|
9
|
Faster Deterministic Dictionaries
– Rasmus Pagh, Rasmus Pagh, Rasmus Pagh
- 1999
|
|
6
|
Hash and displace: Efficient evaluation of minimal perfect hash functions
– Rasmus Pagh
- 1999
|
|
6
|
A Trade-Off For Worst-Case Efficient Dictionaries
– Rasmus Pagh
|
|
1
|
/ pagh/papers/ One-Probe Search
– Rasmus Pagh, Anna Östlin
|
|
86
|
Cuckoo hashing
– Rasmus Pagh, Flemming Friche Rodler
- 2001
|
|
2
|
Dispersing Hash Functions
– Rasmus Pagh
- 2000
|
|
27
|
Cell Probe Complexity - a Survey
– Peter Bro Miltersen
- 1999
|
|
3
|
Hashing, Randomness and Dictionaries
– Rasmus Pagh
- 2002
|
|
1
|
Lower Bound Techniques for Data Structures
– Mihai Patrascu
- 2008
|
|
18
|
Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time
– Rasmus Pagh
- 1998
|
|
4
|
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
– Michael Elkin
- 2006
|
|
5
|
Lower Bounds for Dynamic Algebraic Problems
– Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
- 1999
|
|
43
|
Exact and Approximate Distances in Graphs - a survey
– Uri Zwick
- 2001
|
|
5
|
Dynamic Representations of Sparse Graphs
– Gerth Stølting Brodal, Rolf Fagerberg
- 1999
|
|
6
|
Fully-dynamic orthogonal range reporting on RAM
– Christian Worm Mortensen, Christian Worm Mortensen
- 2003
|
|
4
|
On adaptive integer sorting
– Anna Pagh, Rasmus Pagh, Mikkel Thorup
- 2004
|
|
|
Web www.itu.dkOptimal Static Range Reporting in One Dimension
– Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe, Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe, Stephen Alstrup, Gerth Stølting, Brodal Theis Rauhe
- 2000
|
|
6
|
Compressed dictionaries: Space measures, data sets, and experiments
– Ankur Gupta, Wing-kai Hon, Rahul Shah, Jeffrey Scott Vitter
- 2006
|
|
15
|
Optimal static range reporting in one dimension
– Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe
- 2001
|
