- LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME #
- Basic External Memory Data Structures Rasmus Pagh ?
- To appear in proceedings of ICALP 2002. psy227 Springer Verlag. Available online at http://www.brics.dk/ pagh/papers/
- Hashing, randomness and dictionaries Rasmus Pagh
- On the Cell Probe Complexity of Membership and Perfect Hashing
- Cuckoo Hashing Rasmus Pagh 1
- Rasmus Pagh Dynamic range reporting in
- Nordic Journal of Computing A TRADE-OFF FOR WORST-CASE EFFICIENT
- Deterministic Dictionaries * Torben Hagerup
- Fast Random Access to Wavelet Compressed Volumetric Data Using Hashing
- Optimal TimeSpace TradeO#s for NonComparisonBased Sorting # Rasmus Pagh + Jakob Pagter #
- Short version appeared at WADS 1999, LNCS 1663, p. 49{54. Springer Verlag. Available on-line at http://www.brics.dk/~pagh/papers/
- On the Adaptiveness of Quicksort Rolf Fagerberg
- The dial a ride problem (DARP) 0.6364 0.3636
- The Tree Inclusion Problem: In Optimal Space and Faster
- Construction of Minimum-Weight Spanners Mikkel Sigurd and Martin Zachariasen
- To appear in proceedings of ICALP 2002. psy227 Springer Verlag. Available on-line at http://www.brics.dk/ pagh/papers/
- Cuckoo Hashing Rasmus Pagh 1
- Deterministic load balancing and dictionaries in the parallel disk model
- Cuckoo Hashing for Undergraduates Rasmus Pagh
- Simple and Space-Efficient Minimal Perfect Hash Functions
- Scalable Computation of Acyclic Joins (Extended Abstract)
- External String Sorting: Faster and Cache-Oblivious
- Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting Rasmus Pagh
- On the Cell Probe Complexity of Membership and Perfect Hashing
- Linear Probing with Constant Independence Rasmus Pagh
- Hashing, randomness and dictionaries Rasmus Pagh
- Deterministic Dictionaries* Torben Hagerup
- Dispersing Hash Functions Rasmus Pagh
- Appears in proceedings of WADS 2000. Springer Verlag. Available on-line at http://www.brics.dk/~pagh/papers/
- UNIFORM HASHING IN CONSTANT TIME AND OPTIMAL SPACE ANNA PAGH AND RASMUS PAGH
- LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME
- Appeared at SODA 2000, p. 487493. ACM-SIAM. Available on-line at http://www.brics.dk/~pagh/papers/
- DOI: 10.1007/s00224-004-1195-x Theory Comput. Systems 38, 229248 (2005)
- Optimality in External Memory Hashing Morten Skaarup Jensen
- Uniform Hashing in Constant Time and Linear Space Anna Ostlin
- Short version appeared at WADS 1999, LNCS 1663, p. 4954. Springer Verlag. Available on-line at http://www.brics.dk/~pagh/papers/
- On Adaptive Integer Sorting , Rasmus Pagh1
- An Optimal Bloom Filter Replacement Rasmus Pagh
- On Dynamic Range Reporting in One Dimension (Extended Abstract)
- 1Dagstuhl Seminar, July 2004 Will the I/O model survive till
- Appeared at ICALP 1999, LNCS 1644, p. 595604. Springer Verlag. Available on-line at http://www.brics.dk/~pagh/papers/
