The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Median split trees: a fast lookup technique for frequently occuring keys
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
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
Associative model of morphological analysis: an empirical inquiry
Computational Linguistics
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
An Efficient Implementation of Static String Pattern Matching Machines
IEEE Transactions on Software Engineering
A more cost effective algorithm for finding perfect hash functions
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
Fast hashing of variable-length text strings
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
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
A modulus oriented hash function for the construction of minimal perfect tables
ACM SIGPLAN Notices
An undergraduate project to compute minimal perfect hashing functions
ACM SIGCSE Bulletin
A new hashing function: statistical behaviour and algorithm
ACM SIGIR Forum
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Near perfect hash table for image databases
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
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 for reserved word lists
ACM SIGPLAN Notices
Technical correspondence: on Cichelli's algorithm for finding minimal perfect hash functions
Communications of the ACM
Hash table methods for case statements
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
Using Tries to Eliminate Pattern Collisions in Perfect Hashing
IEEE Transactions on Knowledge and Data Engineering
A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Lexicon design using perfect hash functions
CHI '81 Proceedings of the Joint Conference on Easier and More Productive Use of Computer Systems. (Part - II): Human Interface and the User Interface - Volume 1981
A letter oriented minimal perfect hashing function
ACM SIGPLAN Notices
A perfect hash function for Ada reserved words
ACM SIGAda Ada Letters
Optimal table lookup for reserved words in Ada
ACM SIGAda Ada Letters
Efficient implementation of Aho–Corasick pattern matching automata using Unicode
Software—Practice & Experience
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
Updated MPHF weights for Ada 2012
ACM SIGAda Ada Letters
| Hi-index | 48.33 |
A method is presented for computing machine independent, minimal perfect hash functions of the form: hash value ← key length + the associated value of the key's first character + the associated value of the key's last character. Such functions allow single probe retrieval from minimally sized tables of identifier lists. Application areas include table lookup for reserved words in compilers and filtering high frequency words in natural language processing. Functions for Pascal's reserved words, Pascal's predefined identifiers, frequently occurring English words, and month abbreviations are presented as examples.