An Analysis of Random-Walk Cuckoo Hashing

DOI10.1137/090770928zbMath1222.68073OpenAlexW2050309875WikidataQ57401448 ScholiaQ57401448MaRDI QIDQ5892635

Michael Mitzenmacher, Páll Melsted, Alan M. Frieze

Publication date: 29 July 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090770928

zbMATH Keywords

random walkhashingcuckoo

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (7)

Sharp load thresholds for cuckoo hashing ⋮ Greedy Matching in Bipartite Random Graphs ⋮ Balanced allocation through random walk ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Dynamic space efficient hashing ⋮ A faster algorithm for cuckoo insertion and bipartite matching in large graphs ⋮ Dynamic Space Efficient Hashing.

This page was built for publication: An Analysis of Random-Walk Cuckoo Hashing