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
Finding minimal perfect hash functions
SIGCSE '86 Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
A more cost effective algorithm for finding perfect hash functions
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Order preserving minimal perfect hash functions and information retrieval
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
A compendium of key search references
ACM SIGIR Forum
Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
Practical minimal perfect hash functions for large databases
Communications of the ACM
A faster algorithm for constructing minimal perfect hash functions
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
An undergraduate project to compute minimal perfect hashing functions
ACM SIGCSE Bulletin
Parallel construction of minimal perfect hashing functions with neural networks
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Using Tries to Eliminate Pattern Collisions in Perfect Hashing
IEEE Transactions on Knowledge and Data Engineering
ACM SIGGRAPH 2006 Papers
Perfect hash functions for large dictionaries
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
An efficient hash-based searching for specimens in the museum's exhibit
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
| Hi-index | 48.24 |
A perfect hash function PHF is an injection F from a set W of M objects into the set consisting of the first N nonnegative integers where N ⩾ M. If N = M, then F is a minimal perfect hash function, MPHF. PHFs are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language or commonly employed words in a natural language.The mincycle algorithm for finding PHFs executes with an expected time complexity that is polynomial in M and has been used successfully on sets of cardinality up to 512. Given three pseudorandom functions h0, h1, and h2, the mincycle algorithm searches for a function g such that F(w) = (h0(w) + g ° h1(w) + g ° h2(w)) mod N is a PHF.