Low Redundancy in Static Dictionaries with Constant Query Time
Top Cited Papers
- 1 January 2001
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 31 (2) , 353-363
- https://doi.org/10.1137/s0097539700369909
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Membership in Constant Time and Almost-Minimum SpaceSIAM Journal on Computing, 1999
- Implicit $O(1)$ Probe SearchSIAM Journal on Computing, 1993
- The Spatial Complexity of Oblivious k-Probe Hash FunctionsSIAM Journal on Computing, 1990
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Data Structures and Algorithms 1Published by Springer Nature ,1984
- Should Tables Be Sorted?Journal of the ACM, 1981
- On the difference between consecutive primesInventiones Mathematicae, 1979
- Storing a sparse tableCommunications of the ACM, 1979