A New Trade-off for Deterministic Dictionaries (2000)

Cached

Download Links

by Rasmus Pagh
Citations:1 - 0 self

Active Bibliography

9 Faster Deterministic Dictionaries – Rasmus Pagh, Rasmus Pagh, Rasmus Pagh - 1999
9 Hash and displace: Efficient evaluation of minimal perfect hash functions – Rasmus Pagh - 1999
7 A Trade-Off For Worst-Case Efficient Dictionaries – Rasmus Pagh
1 / pagh/papers/ One-Probe Search – Rasmus Pagh, Anna Östlin
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
3 Dispersing Hash Functions – Rasmus Pagh - 2000
29 Cell probe complexity - a survey – Peter Bro Miltersen
3 Hashing, Randomness and Dictionaries – Rasmus Pagh - 2002
18 Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time – Rasmus Pagh - 1998
1 Lower Bound Techniques for Data Structures – Mihai Patrascu - 2008
5 A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners – Michael Elkin - 2006
11 Worst case constant time priority queue – Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro - 2001
135 Cache-oblivious B-trees – Michael A. Bender, Erik D. Demaine, Martin Farach-colton - 2000
8 Dynamic Representations of Sparse Graphs – Gerth Stølting Brodal, Rolf Fagerberg - 1999
Spring ’12 Scribe Notes Collection – Prof Erik Demaine, Ta Tom Morgan, Justin Zhang, Editing Justin, Zhang Contents
57 Exact and Approximate Distances in Graphs - a survey – Uri Zwick - 2001
6 Lower Bounds for Dynamic Algebraic Problems – Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen - 1998
Constructing Efficient Dictionaries in Close to Sorting Time – unknown authors
4 On adaptive integer sorting – Anna Pagh, Rasmus Pagh, Mikkel Thorup - 2004