Hash and Displace Efficient Evaluation of Minimum Perfect Hash Functions 199

Short version appeared at WADS 1999, LNCS 1663, p. 49–54.  Springer Verlag. Available on-line at http://www.brics.dk/~pagh/papers/Hash and Displace: Efficient Evaluation of Minimal Perfect Hash FunctionsRasmus Pagh1BRICS2, Department of Computer Science, University of Aarhus, 8000 Aarhus C, Denmark Email: pagh@brics.dkAbstractA new way of constructing (minimal) perfect hash functions is described. The technique con- siderably reduces the overhead associated with resolving buckets in two-level h