An Interactive System for Finding Perfect Hash Functions
- 1 November 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Software
- Vol. 2 (6) , 38-53
- https://doi.org/10.1109/ms.1985.232067
Abstract
The interactive implementation of this hash function algorithm presents several examples of large lexicon design, illustrating how the minimality criterion and execution efficiency can vary when various problem parameters are adjusted.Keywords
This publication has 7 references indexed in Scilit:
- Minimal and almost minimal perfect hash function search with application to natural language lexicon designComputers & Mathematics with Applications, 1983
- Reciprocal hashingCommunications of the ACM, 1981
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980
- Perfect hashing functionsCommunications of the ACM, 1977
- Estimating the Efficiency of Backtrack ProgramsMathematics of Computation, 1975
- Scatter storage techniquesCommunications of the ACM, 1968
- Relativ Frequency of English Speech SoundsPublished by Harvard University Press ,1923