A polynomial time generator for minimal perfect hash functions
Communications of the ACM
Finding minimal perfect hash functions
SIGCSE '86 Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
Fast identification of Ada and Modula-2 reserved words
Journal of Pascal, Ada & Modula-2
The design and analysis of coalesced hashing
The design and analysis of coalesced hashing
Communications of the ACM
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
A Monte Carlo study of Cichelli hash-function solvability
Communications of the ACM
Reciprocal hashing: a method for generating minimal perfect hashing functions
Communications of the ACM
Minimal perfect hash functions made simple
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
Communications of the ACM
Communications of the ACM
A letter oriented minimal perfect hashing function
ACM SIGPLAN Notices
Simulation of embedded memories by defective hashing
IBM Journal of Research and Development
A compendium of key search references
ACM SIGIR Forum
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
GAME: an object-oriented approach to computer animation in flexible manufacturing system modelling
ANSS '91 Proceedings of the 24th annual symposium on Simulation
Using Tries to Eliminate Pattern Collisions in Perfect Hashing
IEEE Transactions on Knowledge and Data Engineering
An efficient hash-based searching for specimens in the museum's exhibit
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Low-Cost Identifiers for Ubiquitous Computing
Wireless Personal Communications: An International Journal
| Hi-index | 4.10 |
The authors survey the classical hashing-function approach to information retrieval and show how general hashing techniques exchange speed for memory space and flexibility in data manipulation operations such as insert, delete, and overflow. They also discuss recent developments in perfect hashing and minimal perfect hashing, which provide speed and memory compactness when the keys are known in advance.