More Robust Hashing: Cuckoo Hashing with a Stash

DOI10.1007/978-3-540-87744-8_51zbMath1158.68362OpenAlexW1945549020MaRDI QIDQ5900468

Michael Mitzenmacher, Adam Kirsch, Udi Wieder

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_51

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (7)

Efficient set intersection with simulation-based security ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ Explicit and efficient hash families suffice for cuckoo hashing with a stash ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ Unnamed Item

This page was built for publication: More Robust Hashing: Cuckoo Hashing with a Stash