Implicit $O(1)$ Probe Search
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (1), 1-10
- https://doi.org/10.1137/0222001
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Simulating BPP using a general weak random sourcePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Expanders, randomness, or time versus spaceJournal of Computer and System Sciences, 1988
- A tradeoff between search and update time for the implicit dictionary problemTheoretical Computer Science, 1988
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Should Tables Be Sorted?Journal of the ACM, 1981