| 2009 |
|---|
| 44 | EE | Djamal Belazzougui,
Paolo Boldi,
Rasmus Pagh,
Sebastiano Vigna:
Theory and Practise of Monotone Minimal Perfect Hashing.
ALENEX 2009: 132-144 |
| 43 | EE | Rasmus Resen Amossen,
Rasmus Pagh:
Faster join-projects and sparse matrix multiplications.
ICDT 2009: 121-126 |
| 42 | EE | Djamal Belazzougui,
Paolo Boldi,
Rasmus Pagh,
Sebastiano Vigna:
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses.
SODA 2009: 785-794 |
| 2008 |
|---|
| 41 | EE | Martin Dietzfelbinger,
Rasmus Pagh:
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract).
ICALP (1) 2008: 385-396 |
| 40 | EE | Rasmus Pagh:
Cuckoo Hashing.
Encyclopedia of Algorithms 2008 |
| 39 | EE | Morten Skaarup Jensen,
Rasmus Pagh:
Optimality in External Memory Hashing.
Algorithmica 52(3): 403-411 (2008) |
| 38 | EE | Martin Dietzfelbinger,
Rasmus Pagh:
Succinct Data Structures for Retrieval and Approximate Membership
CoRR abs/0803.3693: (2008) |
| 37 | EE | Rasmus Pagh,
S. Srinivasa Rao:
Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes
CoRR abs/0811.2904: (2008) |
| 36 | EE | Anna Pagh,
Rasmus Pagh:
Uniform Hashing in Constant Time and Optimal Space.
SIAM J. Comput. 38(1): 85-96 (2008) |
| 2007 |
|---|
| 35 | EE | Philip Bille,
Anna Pagh,
Rasmus Pagh:
Fast Evaluation of Union-Intersection Expressions.
ISAAC 2007: 739-750 |
| 34 | EE | Anna Pagh,
Rasmus Pagh,
Milan Ruzic:
Linear probing with constant independence.
STOC 2007: 318-327 |
| 33 | EE | Fabiano C. Botelho,
Rasmus Pagh,
Nivio Ziviani:
Simple and Space-Efficient Minimal Perfect Hash Functions.
WADS 2007: 139-150 |
| 32 | EE | Philip Bille,
Anna Pagh,
Rasmus Pagh:
Fast evaluation of union-intersection expressions
CoRR abs/0708.3259: (2007) |
| 31 | EE | Fabiano C. Botelho,
Rasmus Pagh,
Nivio Ziviani:
Perfect Hashing for Data Management Applications
CoRR abs/cs/0702159: (2007) |
| 30 | EE | Peter Tiedemann,
Henrik Reif Andersen,
Rasmus Pagh:
Generic Global Constraints based on MDDs
CoRR abs/cs/0702170: (2007) |
| 2006 |
|---|
| 29 | EE | Erik D. Demaine,
Friedhelm Meyer auf der Heide,
Rasmus Pagh,
Mihai Patrascu:
De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).
LATIN 2006: 349-361 |
| 28 | EE | Anna Pagh,
Rasmus Pagh:
Scalable computation of acyclic joins.
PODS 2006: 225-232 |
| 27 | EE | Mette Berger,
Esben Rune Hansen,
Rasmus Pagh,
Mihai Patrascu,
Milan Ruzic,
Peter Tiedemann:
Deterministic load balancing and dictionaries in the parallel disk model.
SPAA 2006: 299-307 |
| 26 | EE | Rolf Fagerberg,
Anna Pagh,
Rasmus Pagh:
External String Sorting: Faster and Cache-Oblivious.
STACS 2006: 68-79 |
| 25 | EE | Peter Tiedemann,
Henrik Reif Andersen,
Rasmus Pagh:
A Generic Global Constraint based on MDDs
CoRR abs/cs/0611141: (2006) |
| 24 | EE | Anna Pagh,
Rasmus Pagh,
Milan Ruzic:
Linear Probing with Constant Independence
CoRR abs/cs/0612055: (2006) |
| 2005 |
|---|
| 23 | EE | Anna Pagh,
Rasmus Pagh,
S. Srinivasa Rao:
An optimal Bloom filter replacement.
SODA 2005: 823-829 |
| 22 | EE | Christian Worm Mortensen,
Rasmus Pagh,
Mihai Patrascu:
On dynamic range reporting in one dimension.
STOC 2005: 104-111 |
| 21 | EE | Christian Worm Mortensen,
Rasmus Pagh,
Mihai Patrascu:
On Dynamic Range Reporting in One Dimension
CoRR abs/cs/0502032: (2005) |
| 20 | EE | Erik D. Demaine,
Friedhelm Meyer auf der Heide,
Rasmus Pagh,
Mihai Patrascu:
De Dictionariis Dynamicis Pauco Spatio Utentibus
CoRR abs/cs/0512081: (2005) |
| 19 | EE | Dimitris Fotakis,
Rasmus Pagh,
Peter Sanders,
Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time.
Theory Comput. Syst. 38(2): 229-248 (2005) |
| 2004 |
|---|
| 18 | EE | Anna Pagh,
Rasmus Pagh,
Mikkel Thorup:
On Adaptive Integer Sorting.
ESA 2004: 556-579 |
| 17 | EE | Rasmus Pagh,
Flemming Friche Rodler:
Cuckoo hashing.
J. Algorithms 51(2): 122-144 (2004) |
| 2003 |
|---|
| 16 | EE | Dimitris Fotakis,
Rasmus Pagh,
Peter Sanders,
Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time.
STACS 2003: 271-282 |
| 15 | EE | Anna Östlin,
Rasmus Pagh:
Uniform hashing in constant time and linear space.
STOC 2003: 622-628 |
| 2002 |
|---|
| 14 | EE | Rasmus Pagh:
Basic External Memory Data Structures.
Algorithms for Memory Hierarchies 2002: 14-35 |
| 13 | EE | Anna Östlin,
Rasmus Pagh:
One-Probe Search.
ICALP 2002: 439-450 |
| 12 | EE | Rasmus Pagh,
Jakob Pagter:
Optimal time-space trade-offs for non-comparison-based sorting.
SODA 2002: 9-18 |
| 2001 |
|---|
| 11 | EE | Rasmus Pagh,
Flemming Friche Rodler:
Cuckoo Hashing.
ESA 2001: 121-133 |
| 10 | EE | Rasmus Pagh,
Flemming Friche Rodler:
Lossy Dictionaries.
ESA 2001: 300-311 |
| 9 | EE | Rasmus Pagh:
On the cell probe complexity of membership and perfect hashing.
STOC 2001: 425-432 |
| 8 | | Torben Hagerup,
Peter Bro Miltersen,
Rasmus Pagh:
Deterministic Dictionaries.
J. Algorithms 41(1): 69-85 (2001) |
| 7 | EE | Rasmus Pagh:
Low Redundancy in Static Dictionaries with Constant Query Time.
SIAM J. Comput. 31(2): 353-363 (2001) |
| 2000 |
|---|
| 6 | | Rasmus Pagh:
Dispersing Hash Functions.
ICALP Satellite Workshops 2000: 53-68 |
| 5 | EE | Rasmus Pagh:
Faster deterministic dictionaries.
SODA 2000: 487-493 |
| 4 | EE | Rasmus Pagh:
A New Trade-Off for Deterministic Dictionaries.
SWAT 2000: 22-31 |
| 3 | | Rasmus Pagh:
A Trade-Off for Worst-Case Efficient Dictionaries.
Nord. J. Comput. 7(3): 151-163 (2000) |
| 1999 |
|---|
| 2 | EE | Rasmus Pagh:
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time.
ICALP 1999: 595-604 |
| 1 | EE | Rasmus Pagh:
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions.
WADS 1999: 49-54 |
