Near-perfect hashing of large word sets
- 1 October 1989
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 19 (10) , 967-978
- https://doi.org/10.1002/spe.4380191005
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A polynomial time generator for minimal perfect hash functionsCommunications of the ACM, 1985
- 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
- Perfect hashing functionsCommunications of the ACM, 1977