Open-addressed hash tables without reordering can achieve O(1) amortized and O(log 1/delta) worst-case expected probe complexity, and greedy schemes achieve O(log^2 1/delta), disproving Yao's conjecture.
Bender, Martin Farach-Colton, Simai He, Brad ley C
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimal Bounds for Open Addressing Without Reordering
Open-addressed hash tables without reordering can achieve O(1) amortized and O(log 1/delta) worst-case expected probe complexity, and greedy schemes achieve O(log^2 1/delta), disproving Yao's conjecture.