An optimal algorithm for generating minimal perfect hash functions
- 1 October 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 43 (5) , 257-264
- https://doi.org/10.1016/0020-0190(92)90220-p
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A new universal class of hash functions and dynamic hashing in real timePublished by Springer Nature ,2005
- Practical minimal perfect hash functions for large databasesCommunications of the ACM, 1992
- Order-preserving minimal perfect hash functions and information retrievalACM Transactions on Information Systems, 1991
- Minimal perfect hashing in polynomial timeBIT Numerical Mathematics, 1990
- An algebraic approach to Cichelli's perfect hashingBIT Numerical Mathematics, 1989
- A versatile data structure for edge-oriented graph algorithmsCommunications of the ACM, 1987
- Finding minimal perfect hash functionsACM SIGCSE Bulletin, 1986
- The study of an ordered minimal perfect hashing schemeCommunications of the ACM, 1984
- Reciprocal hashingCommunications of the ACM, 1981
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980