Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time (1999)

Cached

Download Links

by Rasmus Pagh
Venue:IN PROCEEDINGS OF THE 26TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING (ICALP '99
Citations:21 - 5 self

Active Bibliography

18 Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time – Rasmus Pagh - 1998
50 LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME – Rasmus Pagh - 2001
191 Succinct indexable dictionaries with applications to encoding k-ary trees and multisets – Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
2 Optimal space-time dictionaries over an unbounded universe with flat implicit trees – Gianni Franceschini, Roberto Grossi - 2003
3 Hashing, Randomness and Dictionaries – Rasmus Pagh - 2002
19 Static Dictionaries on AC^0 RAMs: Query time Θ(,/log n / log log n) is necessary and sufficient – Arne Andersson, Peter Bro Miltersen, et al. - 1996
9 Hash and displace: Efficient evaluation of minimal perfect hash functions – Rasmus Pagh - 1999
63 Optimal Bounds for the Predecessor Problem – Paul Beame, Faith E. Fich
14 Tables Should Be Sorted (on Random Access Machines) – Faith Fich, Peter Bro Miltersen - 1995
Spring ’12 Scribe Notes Collection – Prof Erik Demaine, Ta Tom Morgan, Justin Zhang, Editing Justin, Zhang Contents
12 On the Probe Complexities of Membership and Perfect Hashing – Rasmus Pagh
29 Cell probe complexity - a survey – Peter Bro Miltersen
9 Faster Deterministic Dictionaries – Rasmus Pagh, Rasmus Pagh, Rasmus Pagh - 1999
31 Compact Routing Tables for Graphs of Bounded Genus – Cyril Gavoille, Nicolas Hanusse - 2000
124 Cuckoo hashing – Rasmus Pagh, Flemming Friche Rodler - 2001
Static Dictionaries on ACO RAMs: Query time 0 (,/log n / log log n) is necessary and sufficient* – Arne Andersson, Peter Bro, Miltersent Soren, Riis Mikkel Thorup
7 Lower bounds for static dictionaries on RAMs with bit operations but no multiplication – Peter Bro Miltersen - 1996
Information Processing Letters 83 (2002) 267--274 – Www Elsevier Com, Amnon Ta-shma
57 Are bitvectors optimal? – H. Buhrman, P. B. Miltersen, J. Radhakrishnan, S. Venkatesh