Fast identification of Ada and Modula-2 reserved words
Journal of Pascal, Ada & Modula-2
Near—perfect hashing of large word sets
Software—Practice & Experience
Practical minimal perfect hash functions for large databases
Communications of the ACM
An undergraduate project to compute minimal perfect hashing functions
ACM SIGCSE Bulletin
An optimal algorithm for generating minimal perfect hash functions
Information Processing Letters
Minimal perfect hash functions made simple
Communications of the ACM
ADA Plus Data Structures: An Object-Based Approach
ADA Plus Data Structures: An Object-Based Approach
Updated MPHF weights for Ada 2012
ACM SIGAda Ada Letters
| Hi-index | 0.01 |
Recently a colleague wanted to include a section on perfect hashing functions in the latest edition of a book [4], and after an on-line search brought up a reference of mine [8], he sent me an email asking if I could generate a minimal perfect hashing function (MPHF) for the set of reserved words in Ada 2005. This is a summary of the process that determined one.