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:23 - 5 self

Active Bibliography

18 Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time – Rasmus Pagh - 1998
49 LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME – Rasmus Pagh - 2001
lookup time – Rasmus Pagh, Rasmus Pagh - 1998
LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME∗ – unknown authors
192 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
223 Computationally private information retrieval with polylogarithmic communication – Christian Cachin, Silvio Micali, Markus Stadler - 1999
61 Optimal Bounds for the Predecessor Problem – Paul Beame, Faith E. Fich