On the Insertion Time of Cuckoo Hashing

DOI10.1137/100797503zbMath1285.68064arXiv1006.1231OpenAlexW2040748620MaRDI QIDQ5408762

Nikolaos Fountoulakis, Angelika Steger, Konstantinos D. Panagiotou

Publication date: 11 April 2014

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

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

zbMATH Keywords

information retrievalhashingrandom graphs and hypergraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Abstract data types; algebraic specification (68Q65)

Related Items (6)

Balanced allocation through random walk ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Random-index PIR and applications ⋮ 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: On the Insertion Time of Cuckoo Hashing