An undergraduate project to compute minimal perfect hashing functions

Authors:
John A. Trono
Affiliations:
-
Venue:
ACM SIGCSE Bulletin
Year:
1992

Citing 6
Cited 2

A polynomial time generator for minimal perfect hash functions

Communications of the ACM
The study of an ordered minimal perfect hashing scheme

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
An O(n log n) Algorithm for Finding Minimal Perfect Hash Functions

An O(n log n) Algorithm for Finding Minimal Perfect Hash Functions
A More Cost Effective Algorithm for Finding Perfect Hash Functions

A More Cost Effective Algorithm for Finding Perfect Hash Functions

A comparison of three strategies for computing letter oriented, minimal perfect hashing functions

ACM SIGPLAN Notices
Optimal table lookup for reserved words in Ada

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some heuristics for computing the character weights in a Cichelli-style, minimal perfect hashing function are given. These ideas should perform best when applied to relatively small, static sets of character strings and they can be used as the foundation for a large programming assignment. An example using the names of the fifty United States is given to illustrate how the weights are determined.