De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results

DOI10.1007/978-3-642-02927-1_11zbMath1248.68230OpenAlexW1654197113MaRDI QIDQ3638028

Gil Segev, Moni Naor, Yuriy Arbitman

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (14)

Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Sharp load thresholds for cuckoo hashing ⋮ The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online ⋮ External-memory multimaps ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Approximating frequent items in asynchronous data stream over a sliding window ⋮ Dynamic space efficient hashing ⋮ Pseudo-random graphs and bit probe schemes with one-sided error ⋮ Oblivious network RAM and leveraging parallelism to achieve obliviousness ⋮ A faster algorithm for cuckoo insertion and bipartite matching in large graphs ⋮ Dynamic Space Efficient Hashing. ⋮ Unnamed Item ⋮ Computing the maximum exponent in a stream

This page was built for publication: De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results