Collections of Functions for Perfect Hashing
- 1 May 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (2), 604-618
- https://doi.org/10.1137/0215044
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- On the program size of perfect and universal hash functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Geometric Problems with Application to HashingSIAM Journal on Computing, 1982
- Reciprocal hashingCommunications of the ACM, 1981
- Should Tables Be Sorted?Journal of the ACM, 1981
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980
- Storing a sparse tableCommunications of the ACM, 1979
- Perfect hashing functionsCommunications of the ACM, 1977
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's ConjectureCanadian Journal of Mathematics, 1960