Incremental Open Addressing Has No Time-Space Tradeoff
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Comments: 46 pages, 4 figures, 1 table
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Hashing for Sampling-Based Estimation
- Fast Insertion for Bucketized Cuckoo Hashing
- A Sharp Analysis of Fixed Offset Hash Tables
- A Simple Analysis of Quadratic Probing and Other Open Addressing Schemes
- Quadratic Probing Revisited: Smoothed Analysis and the Fall of Robin Hood
- Linear Probing with Non-Greedy Insertions
- Resizable Retrieval
- An Analysis of Brent's Insertion Method for Hash Tables
- Locality in Open Addressing Hash Tables
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time