Minimal perfect hashing in polynomial time
- 1 June 1990
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 30 (2) , 235-244
- https://doi.org/10.1007/bf02017345
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A polynomial time generator for minimal perfect hash functionsCommunications of the ACM, 1985
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- 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
- Fast modular transformsJournal of Computer and System Sciences, 1974