Dynamic Space Efficient Hashing.

DOI10.4230/LIPIcs.ESA.2017.58zbMath1442.68039OpenAlexW2951346356MaRDI QIDQ5111747

Peter Sanders, Tobias Maier

Publication date: 27 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2017.58

zbMATH Keywords

dynamic data structurescuckoo hashingspace efficiencyopen addressingclosed hashing

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

Engineering Practical Lempel-Ziv Tries ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries ⋮ Dynamic space efficient hashing

Cites Work

• Unnamed Item
• Cuckoo hashing: Further analysis
• The analysis of double hashing
• Space efficient hash tables with worst case constant access time
• Balanced allocation and dictionaries with tightly packed constant size bins
• Cuckoo Hashing with Pages
• Tight Thresholds for Cuckoo Hashing via XORSAT
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Some Open Questions Related to Cuckoo Hashing
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Cuckoo hashing
• On the Insertion Time of Cuckoo Hashing
• Less Hashing, Same Performance: Building a Better Bloom Filter
• An Analysis of Random-Walk Cuckoo Hashing

This page was built for publication: Dynamic Space Efficient Hashing.