An Analysis of Random-Walk Cuckoo Hashing

@inproceedings{Frieze2009AnAO,
  title={An Analysis of Random-Walk Cuckoo Hashing},
  author={Alan M. Frieze and P{\'a}ll Melsted and Michael Mitzenmacher},
  booktitle={APPROX-RANDOM},
  year={2009}
}
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing provides a useful methodology for building practical, high-performance hash tables. The essential idea of cuckoo hashing is to combine the power of schemes that allow multiple hash locations for an item with the power to dynamically change the location of an item among its possible locations. Previous work on the case… CONTINUE READING
Highly Cited
This paper has 53 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
35 Citations
15 References
Similar Papers

Citations

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

53 Citations

01020'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…