Bipartite Random Graphs and Cuckoo Hashing

@inproceedings{Kutzelnigg2006BipartiteRG,
  title={Bipartite Random Graphs and Cuckoo Hashing},
  author={Reinhard Kutzelnigg},
  year={2006}
}
The aim of this paper is to extend the analysis of Cuckoo Hashing of Devroye and Morin in 2003. In particular we make several asymptotic results much more precise. We show, that the probability that the construction of a hash table succeeds, is asymptotically 1 − c(ε)/m + O(1/m) for some explicit c(ε), where m denotes the size of each of the two tables, n = m(1 − ε) is the number of keys and ε ∈ (0, 1). The analysis rests on a generating function approach to the so called Cuckoo Graph, a random… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

The number of components of a random bipartite graph

  • I. B. Kalugin
  • Discrete Math. Appl.,
  • 1991
Highly Influential
5 Excerpts

Cuckoo hashing. Research Series RS-01-32

  • R. Pagh, F. F. Rodler
  • BRICS, Department of Computer Science, University…
  • 2001
1 Excerpt

The number of trees with nodes of alternate parity

  • H. I. Scoins
  • Proc. Cambridge Philos. Soc.,
  • 1962
2 Excerpts

Saddle-point methods for the multinomial distribution

  • I. J. Good
  • Ann. Math. Stat.,
  • 1957
1 Excerpt

Similar Papers

Loading similar papers…