On the insertion time of random walk cuckoo hashing

DOI10.1137/1.9781611974782.97MaRDI QIDQ4575840zbMATH OpenOpenAlexFDO

Authors Tony Johansson, Alan Frieze

Publication date 16 July 2018

Published in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random walks on graphs (05C81) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the insertion time of random walk cuckoo hashing
• On the insertion time of cuckoo hashing
• An Analysis of Random-Walk Cuckoo Hashing
• An analysis of random-walk cuckoo hashing
• Cuckoo hashing: Further analysis

Cited in

(7)

• Balanced allocation through random walk
• On the insertion time of random walk cuckoo hashing
• On the insertion time of cuckoo hashing
• An analysis of random-walk cuckoo hashing
• An Analysis of Random-Walk Cuckoo Hashing
• Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
• Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures

This page was built for publication: On the insertion time of random walk cuckoo hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575840)