Results 1 
2 of
2
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 42 (0 self)
 Add to MetaCart
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
LBNL57527 A Simpler Proof Of The Average Case Complexity Of UnionFind With Path Compression
, 2005
"... We present a modified unionfind algorithm that represent the data in an array rather than the commonly used pointerbased data structures, and a simpler proof that the average case complexity of the unionfind algorithm is linear. ..."
Abstract
 Add to MetaCart
We present a modified unionfind algorithm that represent the data in an array rather than the commonly used pointerbased data structures, and a simpler proof that the average case complexity of the unionfind algorithm is linear.