Some recent articles about research on hash tables made us realize we probably didn't know enough about hash tables, one of the fundamental data structures in the biz.  We talk about the history of hashing and hash tables, and some recent results that overturned a 40 year old conjecture on the most efficient way to insert items.


Scientists Find Optimal Balance of Data Storage and Time | Quanta Magazine

[2111.00602] On the Optimal Time/Space Tradeoff for Hash Tables

Speeding Up Hash Tables | Communications of the ACM

https://dl.acm.org/doi/epdf/10.1145/1734714.1734729

[2109.04548] Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once

Modern Dictionaries by Raymond Hettinger

FOCS 2024 3B Optimal Bounds for Open Addressing Without Reordering

Optimal Bounds for Open Addressing Without Reordering



Send us Fan Mail

Rss Apple Podcaster
Podden och tillhörande omslagsbild på den här sidan tillhör Erik Aker and Mike Mull. Innehållet i podden är skapat av Erik Aker and Mike Mull och inte av, eller tillsammans med, Poddtoppen.