A backtracking method for constructing perfect hash functions from a set of mapping functions
- 1 March 1985
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 25 (1) , 148-164
- https://doi.org/10.1007/bf01934995
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The study of an ordered minimal perfect hashing schemeCommunications of the ACM, 1984
- A letter oriented minimal perfect hashing functionACM SIGPLAN Notices, 1982
- Reciprocal hashingCommunications of the ACM, 1981
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980
- Comments on perfect hashing functionsCommunications of the ACM, 1979
- Perfect hashing functionsCommunications of the ACM, 1977
- Hash Table MethodsACM Computing Surveys, 1975
- Identifier Search Mechanisms: A Survey and Generalized ModelACM Computing Surveys, 1974
- Scatter storage techniquesCommunications of the ACM, 1968
- Programming Technique: An improved hash code for scatter storageCommunications of the ACM, 1968