An Optimal Algorithm for Generating Minimal Perfect Hash Functions (1992)
by
Zbigniew J. Czech
,
George Havas
,
Bohdan S. Majewski
| Venue: | Information Processing Letters |
| Citations: | 37 - 0 self |
BibTeX
@ARTICLE{Czech92anoptimal,
author = {Zbigniew J. Czech and George Havas and Bohdan S. Majewski},
title = {An Optimal Algorithm for Generating Minimal Perfect Hash Functions},
journal = {Information Processing Letters},
year = {1992},
volume = {43},
pages = {257--264}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A new algorithm for generating order preserving minimal perfect hash functions is presented. The algorithm is probabilistic, involving generation of random graphs. It uses expected linear time and requires a linear number words to represent the hash function, and thus is optimal up to constant factors. It runs very fast in practice. Keywords: Data structures, probabilistic algorithms, analysis of algorithms, hashing, random graphs
