Skip to the content.
sunarch
tech
programming
data structures
data structures
hash table
Undergraduate Upends a 40-Year-Old Data Science Conjecture
article
reprint
on Wired.com
paper:
Optimal Bounds for Open Addressing Without Reordering
on arxiv.org (by Martin Farach-Colton, Andrew Krapivin, William Kuszmaul)