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

Documents Related by Co-Citation

61 Membership in constant time and almost-minimum space – A Brodnik, J I Munro - 1999
120 Should tables be sorted – Andrew Chi-chih Yao - 1981
207 Storing a sparse table with O(1) worst case access time – M Fredman, J Komlós, E Szemerédi - 1984
49 Are bitvectors optimal? – H. Buhrman, P. B. Miltersen, J. Radhakrishnan, S. Venkatesh
172 Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract – Roberto Grossi, Jeffrey, Scott Vitter - 2000
163 High-order entropy-compressed text indexes – Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter - 2003
137 Data Structures and Algorithms 1: Sorting and Searching – K Mehlhorn - 1984
149 Succinct indexable dictionaries with applications to encoding k-ary trees and multisets – Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
39 Squeezing succinct data structures into entropy bounds – K Sadakane, R Grossi - 2006
49 Succinct Static Data Structures – G Jacobson - 1989
17 Implicit O(1) probe search – A Fiat, M Naor - 1993
142 Opportunistic Data Structures with Applications – Paolo Ferragina, Giovanni Manzini - 2000
10 The complexity of some simple retrieval problems – P Elias, R A Flower - 1975
5 The bitprobe complexity measure revisited – P B Miltersen - 1993
74 On Data Structures and Asymmetric Communication Complexity – Peter Bro Miltersen, Shmuel Safra, Noam Nisan, Avi Wigderson - 1994
34 The spatial complexity of oblivious k-probe hash functions – J P Schmidt, A Siegel - 1990
17 Membership in Constant Time and Minimum Space – Andrej Brodnik, J. Ian Munro - 1994
72 Extracting all the Randomness and Reducing the Error in Trevisan's Extractors – Ran Raz, Omer Reingold, Salil Vadhan - 1999
250 Hardness vs. randomness – Noam Nisan - 1994