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

Document Versions

Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time –Rasmus Pagh — 1999 — IN PROCEEDINGS OF THE 26TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING (ICALP '99
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time –Rasmus Pagh — 1999 — In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP '99
Low redundancy in static dictionaries with O(1) lookup time –Rasmus Pagh — 1999 — In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP '99