Results 1 
3 of
3
An Optimal Algorithm for Generating Minimal Perfect Hash Functions
 Information Processing Letters
, 1992
"... 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 facto ..."
Abstract

Cited by 50 (1 self)
 Add to MetaCart
(Show Context)
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
COMBINATORKA Akad~miai Kiad6 SpringerVerlag COMBnqATOPJCA 9 (4) (1989) 363374 ON RANDOM MINIMUM LENGTH SPANNING TREES
, 1988
"... We extend and strengthen the result hat, in the complete graph K, with independent random edgelengths uniformly distributed on [0, I], the expected length of the minimum spanning tree tends to s as n ~. In particular, ifK. is replaced by the complete bipartite graph Kn. ~ then there is a correspo ..."
Abstract
 Add to MetaCart
(Show Context)
We extend and strengthen the result hat, in the complete graph K, with independent random edgelengths uniformly distributed on [0, I], the expected length of the minimum spanning tree tends to s as n ~. In particular, ifK. is replaced by the complete bipartite graph Kn. ~ then there is a corresponding limit of 2~(3). 1.