An ordered minimal perfect hashing scheme based upon Euler's theorem
- 30 June 1984
- journal article
- Published by Elsevier in Information Sciences
- Vol. 32 (3) , 165-172
- https://doi.org/10.1016/0020-0255(84)90032-x
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A letter oriented minimal perfect hashing functionACM SIGPLAN Notices, 1982
- Reciprocal hashingCommunications of the ACM, 1981
- Technical Response to: On Cichelli's Minimal Perfect Hash Functions MethodCommunications of the ACM, 1980
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980
- Hash Table MethodsACM Computing Surveys, 1975
- Key-to-address transform techniquesCommunications of the ACM, 1971
- Scatter storage techniquesCommunications of the ACM, 1968
- File organization and addressingIBM Systems Journal, 1963
- An indirect chaining method for addressing on secondary keysCommunications of the ACM, 1961
- Addressing for Random-Access StorageIBM Journal of Research and Development, 1957