Storing a Sparse Table with 0 (1) Worst Case Access Time
- 26 June 1984
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 31 (3), 538-544
- https://doi.org/10.1145/828.1884
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Reciprocal hashingCommunications of the ACM, 1981
- Should Tables Be Sorted?Journal of the ACM, 1981
- Storing a sparse tableCommunications of the ACM, 1979
- Perfect hashing functionsCommunications of the ACM, 1977