Space efficient hash tables with worst case constant access time
From MaRDI portal
Publication:1771320
DOI10.1007/s00224-004-1195-xzbMath1066.68025OpenAlexW2136399778WikidataQ59818745 ScholiaQ59818745MaRDI QIDQ1771320
Rasmus Pagh, Dimitris Fotakis, Peter Sanders, Paul G. Spirakis
Publication date: 19 April 2005
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-004-1195-x
Related Items (21)
Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Sharp load thresholds for cuckoo hashing ⋮ Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables ⋮ Balanced allocation and dictionaries with tightly packed constant size bins ⋮ Fast and simple compact hashing via bucketing ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Balanced allocation through random walk ⋮ Load Thresholds for Cuckoo Hashing with Overlapping Blocks ⋮ Generalized cuckoo hashing with a stash, revisited ⋮ Hardness-preserving reductions via cuckoo hashing ⋮ Balls into non-uniform bins ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Explicit and efficient hash families suffice for cuckoo hashing with a stash ⋮ Dynamic dictionaries for multisets and counting filters with constant time operations ⋮ Dynamic space efficient hashing ⋮ Dynamic Space Efficient Hashing. ⋮ Load Thresholds for Cuckoo Hashing with Double Hashing ⋮ Adaptive Cuckoo Filters ⋮ Towards optimal degree distributions for left-perfect matchings in random bipartite graphs
This page was built for publication: Space efficient hash tables with worst case constant access time
