An Analysis of Random-Walk Cuckoo Hashing

DOI10.1007/978-3-642-03685-9_37zbMath1255.68059OpenAlexW2154805110WikidataQ59768696 ScholiaQ59768696MaRDI QIDQ5902165

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

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.392

zbMATH Keywords

random walk algorithmcuckoo hashing

Mathematics Subject Classification ID

Data structures (68P05) Random walks on graphs (05C81) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Dynamic averaging load balancing on cycles

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