Combinatorica

, Volume 13, Issue 1, pp 83–96

More analysis of double hashing

  • George S. Lueker
  • Mariko Molodowitch
Article

DOI: 10.1007/BF01202791

Cite this article as:
Lueker, G.S. & Molodowitch, M. Combinatorica (1993) 13: 83. doi:10.1007/BF01202791

Abstract

In [8], a deep and elegant analysis shows that double hashing is asymptotically equivalent to the ideal uniform hashing up to a load factor of about 0.319. In this paper we show how a randomization technique can be used to develop a surprisingly simple proof of the result that this equivalence holds for load factors arbitrarily close to 1.

AMS subject Classification Code (1991)

68 Q 25 68 P 10 11 B 25 

Copyright information

© Akadémiai Kiadó 1993

Authors and Affiliations

  • George S. Lueker
    • 1
  • Mariko Molodowitch
    • 2
  1. 1.Department of Information and Computer ScienceUniversity of California, IrvineIrvineUSA
  2. 2.California State University, FullertonFullertonUSA

Personalised recommendations