More analysis of double hashing

George S. Lueker, Mariko Molodowitch
1993 Combinatorica  
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. t An earlier version of the paper was presented at the
doi:10.1007/bf01202791 fatcat:l5bqeqwg7rab3gdc5a63wqfm5y