Minimal and almost minimal perfect hash function search with application to natural language lexicon design
- 1 January 1983
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 9 (1) , 215-231
- https://doi.org/10.1016/0898-1221(83)90016-0
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Reciprocal hashingCommunications of the ACM, 1981
- Technical correspondenceCommunications of the ACM, 1981
- Experience with a space efficient way to store a dictionaryCommunications of the ACM, 1981
- On Additive Bases and Harmonious GraphsSIAM Journal on Algebraic Discrete Methods, 1980
- Technical Response to: On Cichelli's Minimal Perfect Hash Functions MethodCommunications of the ACM, 1980
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980
- Estimating the Efficiency of Backtrack ProgramsMathematics of Computation, 1975
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970
- Scatter storage techniquesCommunications of the ACM, 1968
- The external language KLIPA for the URAL-2 digital computerCommunications of the ACM, 1963