A precise analysis of Cuckoo hashing
From MaRDI portal
Publication:3189052
DOI10.1145/2151171.2151174zbMath1295.68234OpenAlexW2153091612MaRDI QIDQ3189052
Michael Drmota, Reinhard Kutzelnigg
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2151171.2151174
Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (4)
SSE and SSD: page-efficient searchable symmetric encryption ⋮ Sharp load thresholds for cuckoo hashing ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
This page was built for publication: A precise analysis of Cuckoo hashing