Minimal perfect hash functions for reserved word lists

Authors:
Robert W. Sebasta;Mark A. Taylor
Affiliations:
Department of Computer Science, University of Colorado, Austin Bluffs Parkway, Colorado Springs, CO;Department of Computer Science, University of Colorado, Austin Bluffs Parkway, Colorado Springs, CO
Venue:
ACM SIGPLAN Notices
Year:
1985

Citing 7
Cited 0

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Reciprocal hashing: a method for generating minimal perfect hashing functions

Communications of the ACM
Minimal perfect hash functions made simple

Communications of the ACM
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 letter oriented minimal perfect hashing function

ACM SIGPLAN Notices
A perfect hash function for Ada reserved words

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract