Balanced allocation through random walk

DOI10.1016/J.IPL.2017.11.010zbMath1423.68609arXiv1708.04945OpenAlexW2963524154MaRDI QIDQ1685024

Samantha Petti, Alan M. Frieze

Publication date: 13 December 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.04945

zbMATH Keywords

online algorithmsrandom walkcuckoo hashingbalanced allocation

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Space efficient hash tables with worst case constant access time
• Balanced allocation and dictionaries with tightly packed constant size bins
• On the insertion time of random walk cuckoo hashing
• Cuckoo hashing
• On the Insertion Time of Cuckoo Hashing
• An Analysis of Random-Walk Cuckoo Hashing

This page was built for publication: Balanced allocation through random walk