| 2012 |
|---|
| 68 | Colorful triangle counting and a MapReduce implementation. Rasmus Pagh, Charalampos E. Tsourakakis. Inf. Process. Lett. (112): 277-281 (2012). Web SearchBibTeXDownload |
| 67 | I/O-efficient data structures for colored range and prefix reporting. Kasper Green Larsen, Rasmus Pagh. SODA 2012, 583-592. Web SearchBibTeXDownload |
| 2011 |
|---|
| 66 | Theory and practice of monotone minimal perfect hashing. Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. ACM Journal of Experimental Algorithmics (16) (2011). Web SearchBibTeXDownload |
| 65 | Colorful Triangle Counting and a MapReduce Implementation. Rasmus Pagh, Charalampos E. Tsourakakis. CoRR (abs/1103.6073) (2011). Web SearchBibTeXDownload |
| 64 | Compressed Matrix Multiplication. Rasmus Pagh. CoRR (abs/1108.1320) (2011). Web SearchBibTeXDownload |
| 63 | I/O-Efficient Data Structures for Colored Range and Prefix Reporting. Kasper Green Larsen, Rasmus Pagh. CoRR (abs/1104.3084) (2011). Web SearchBibTeXDownload |
| 62 | A New Data Layout For Set Intersection on GPUs. Rasmus Resen Amossen, Rasmus Pagh. CoRR (abs/1102.1003) (2011). Web SearchBibTeXDownload |
| 61 | Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh. ICDM Workshops 2011, 145-150. Web SearchBibTeXDownload |
| 60 | A New Data Layout for Set Intersection on GPUs. Rasmus Resen Amossen, Rasmus Pagh. IPDPS 2011, 698-708. Web SearchBibTeXDownload |
| 59 | Linear Probing with 5-wise Independence. Anna Pagh, Rasmus Pagh, Milan Ruzic. SIAM Review (53): 547-558 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 58 | Better Size Estimation for Sparse Matrix Products. Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh. APPROX-RANDOM 2010, 406-419. Web SearchBibTeXDownload |
| 57 | On Finding Similar Items in a Stream of Transactions. Andrea Campagna, Rasmus Pagh. CoRR (abs/1010.2371) (2010). Web SearchBibTeXDownload |
| 56 | On Finding Frequent Patterns in Directed Acyclic Graphs. Andrea Campagna, Rasmus Pagh. CoRR (abs/1005.0239) (2010). Web SearchBibTeXDownload |
| 55 | Better size estimation for sparse matrix products. Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh. CoRR (abs/1006.4173) (2010). Web SearchBibTeXDownload |
| 54 | On Finding Frequent Patterns in Event Sequences. Andrea Campagna, Rasmus Pagh. CoRR (abs/1010.2358) (2010). Web SearchBibTeXDownload |
| 53 | Fast Prefix Search in Little Space, with Applications. Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. ESA (1) 2010, 427-438. Web SearchBibTeXDownload |
| 52 | Tight Thresholds for Cuckoo Hashing via XORSAT. Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink. ICALP (1) 2010, 213-225. Web SearchBibTeXDownload |
| 51 | Cache-oblivious hashing. Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang. PODS 2010, 297-304. Web SearchBibTeXDownload |
| 2009 |
|---|
| 50 | Theory and Practise of Monotone Minimal Perfect Hashing. Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. ALENEX 2009, 132-144. Web SearchBibTeXDownload |
| 49 | Finding Associations and Computing Similarity via Biased Pair Sampling. Andrea Campagna, Rasmus Pagh. CoRR (abs/0910.0112) (2009). Web SearchBibTeXDownload |
| 48 | Tight Thresholds for Cuckoo Hashing via XORSAT. Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, Andrea Montanari, Rasmus Pagh, Michael Rink. CoRR (abs/0912.0287) (2009). Web SearchBibTeXDownload |
| 47 | Storing a Compressed Function with Constant Time Access. Jóhannes B. Hreinsson, Morten Krøyer, Rasmus Pagh. ESA 2009, 730-741. Web SearchBibTeXDownload |
| 46 | Faster join-projects and sparse matrix multiplications. Rasmus Resen Amossen, Rasmus Pagh. ICDT 2009, 121-126. Web SearchBibTeXDownload |
| 45 | Secondary indexing in one dimension: beyond b-trees and bitmap indexes. Rasmus Pagh, Srinivasa Rao Satti. PODS 2009, 177-186. Web SearchBibTeXDownload |
| 44 | Dispersing hash functions. Rasmus Pagh. Random Struct. Algorithms (35): 70-82 (2009). Web SearchBibTeXDownload |
| 43 | Linear Probing with Constant Independence. Anna Pagh, Rasmus Pagh, Milan Ruzic. SIAM J. Comput. (39): 1107-1120 (2009). Web SearchBibTeXDownload |
| 42 | Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna. SODA 2009, 785-794. Web SearchBibTeXDownload |
| 2008 |
|---|
| 41 | Optimality in External Memory Hashing. Morten Skaarup Jensen, Rasmus Pagh. Algorithmica (52): 403-411 (2008). Web SearchBibTeXDownload |
| 40 | Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes. Rasmus Pagh, S. Srinivasa Rao. CoRR (abs/0811.2904) (2008). Web SearchBibTeXDownload |
| 39 | Succinct Data Structures for Retrieval and Approximate Membership. Martin Dietzfelbinger, Rasmus Pagh. CoRR (abs/0803.3693) (2008). Web SearchBibTeXDownload |
| 38 | Cuckoo Hashing. Rasmus Pagh, Flemming Friche Rodler. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload |
| 37 | Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract). Martin Dietzfelbinger, Rasmus Pagh. ICALP (1) 2008, 385-396. Web SearchBibTeXDownload |
| 36 | Uniform Hashing in Constant Time and Optimal Space. Anna Pagh, Rasmus Pagh. SIAM J. Comput. (38): 85-96 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 35 | Fast evaluation of union-intersection expressions. Philip Bille, Anna Pagh, Rasmus Pagh. CoRR (abs/0708.3259) (2007). Web SearchBibTeXDownload |
| 34 | Generic Global Constraints based on MDDs. Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh. CoRR (abs/cs/0702170) (2007). Web SearchBibTeXDownload |
| 33 | Perfect Hashing for Data Management Applications. Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani. CoRR (abs/cs/0702159) (2007). Web SearchBibTeXDownload |
| 32 | Fast Evaluation of Union-Intersection Expressions. Philip Bille, Anna Pagh, Rasmus Pagh. ISAAC 2007, 739-750. Web SearchBibTeXDownload |
| 31 | Linear probing with constant independence. Anna Pagh, Rasmus Pagh, Milan Ruzic. STOC 2007, 318-327. Web SearchBibTeXDownload |
| 30 | Simple and Space-Efficient Minimal Perfect Hash Functions. Fabiano C. Botelho, Rasmus Pagh, Nivio Ziviani. WADS 2007, 139-150. Web SearchBibTeXDownload |
| 2006 |
|---|
| 29 | Linear Probing with Constant Independence. Anna Pagh, Rasmus Pagh, Milan Ruzic. CoRR (abs/cs/0612055) (2006). Web SearchBibTeXDownload |
| 28 | A Generic Global Constraint based on MDDs. Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh. CoRR (abs/cs/0611141) (2006). Web SearchBibTeXDownload |
| 27 | De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu. LATIN 2006, 349-361. Web SearchBibTeXDownload |
| 26 | Scalable computation of acyclic joins. Anna Pagh, Rasmus Pagh. PODS 2006, 225-232. Web SearchBibTeXDownload |
| 25 | Deterministic load balancing and dictionaries in the parallel disk model. Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann. SPAA 2006, 299-307. Web SearchBibTeXDownload |
| 24 | External String Sorting: Faster and Cache-Oblivious. Rolf Fagerberg, Anna Pagh, Rasmus Pagh. STACS 2006, 68-79. Web SearchBibTeXDownload |
| 2005 |
|---|
| 23 | On Dynamic Range Reporting in One Dimension. Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu. CoRR (abs/cs/0502032) (2005). Web SearchBibTeXDownload |
| 22 | De Dictionariis Dynamicis Pauco Spatio Utentibus. Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu. CoRR (abs/cs/0512081) (2005). Web SearchBibTeXDownload |
| 21 | An optimal Bloom filter replacement. Anna Pagh, Rasmus Pagh, S. Srinivasa Rao. SODA 2005, 823-829. Web SearchBibTeXDownload |
| 20 | On dynamic range reporting in one dimension. Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu. STOC 2005, 104-111. Web SearchBibTeXDownload |
| 19 | Space Efficient Hash Tables with Worst Case Constant Access Time. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis. Theory Comput. Syst. (38): 229-248 (2005). Web SearchBibTeXDownload |
| 2004 |
|---|
| 18 | On Adaptive Integer Sorting. Anna Pagh, Rasmus Pagh, Mikkel Thorup. ESA 2004, 556-579. Web SearchBibTeXDownload |
| 17 | Cuckoo hashing. Rasmus Pagh, Flemming Friche Rodler. J. Algorithms (51): 122-144 (2004). Web SearchBibTeXDownload |
| 2003 |
|---|
| 16 | Space Efficient Hash Tables with Worst Case Constant Access Time. Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis. STACS 2003, 271-282. Web SearchBibTeXDownload |
| 15 | Uniform hashing in constant time and linear space. Anna Östlin, Rasmus Pagh. STOC 2003, 622-628. Web SearchBibTeXDownload |
| 2002 |
|---|
| 14 | Basic External Memory Data Structures. Rasmus Pagh. Algorithms for Memory Hierarchies 2002, 14-35. Web SearchBibTeXDownload |
| 13 | One-Probe Search. Anna Östlin, Rasmus Pagh. ICALP 2002, 439-450. Web SearchBibTeXDownload |
| 12 | Optimal time-space trade-offs for non-comparison-based sorting. Rasmus Pagh, Jakob Pagter. SODA 2002, 9-18. Web SearchBibTeXDownload |
| 2001 |
|---|
| 11 | Lossy Dictionaries. Rasmus Pagh, Flemming Friche Rodler. ESA 2001, 300-311. Web SearchBibTeXDownload |
| 10 | Cuckoo Hashing. Rasmus Pagh, Flemming Friche Rodler. ESA 2001, 121-133. Web SearchBibTeXDownload |
| 9 | Deterministic Dictionaries. Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh. J. Algorithms (41): 69-85 (2001). Web SearchBibTeXDownload |
| 8 | Low Redundancy in Static Dictionaries with Constant Query Time. Rasmus Pagh. SIAM J. Comput. (31): 353-363 (2001). Web SearchBibTeXDownload |
| 7 | On the cell probe complexity of membership and perfect hashing. Rasmus Pagh. STOC 2001, 425-432. Web SearchBibTeXDownload |
| 2000 |
|---|
| 6 | Dispersing Hash Functions. Rasmus Pagh. ICALP Satellite Workshops 2000, 53-68. Web SearchBibTeX |
| 5 | A Trade-Off for Worst-Case Efficient Dictionaries. Rasmus Pagh. Nord. J. Comput. (7): 151-163 (2000). Web SearchBibTeX |
| 4 | Faster deterministic dictionaries. Rasmus Pagh. SODA 2000, 487-493. Web SearchBibTeXDownload |
| 3 | A New Trade-Off for Deterministic Dictionaries. Rasmus Pagh. SWAT 2000, 22-31. Web SearchBibTeXDownload |
| 1999 |
|---|
| 2 | Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time. Rasmus Pagh. ICALP 1999, 595-604. Web SearchBibTeXDownload |
| 1 | Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions. Rasmus Pagh. WADS 1999, 49-54. Web SearchBibTeXDownload |
