A precise analysis of Cuckoo hashing

@article{Drmota2012APA,
  title={A precise analysis of Cuckoo hashing},
  author={Michael Drmota and Reinhard Kutzelnigg},
  journal={ACM Trans. Algorithms},
  year={2012},
  volume={8},
  pages={11:1-11:36}
}
Cuckoo hashing was introduced by Pagh and Rodler in 2001. Its main feature is that it provides constant worst-case search time. The aim of this article is to present a precise average case analysis of Cuckoo hashing. In particular, we determine the probability that Cuckoo hashing produces no conflicts and give an upper bound for the construction time, that is linear in the size of the table. The analysis rests on a generating function approach to the so called Cuckoo Graph, a random bipartite… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS