Hash tables are fundamental ways to store data and are used in every computer. Since the 1970s, researchers have assumed that no improvements could be made to hash table design. Enter Andrew Krapivin who, while an undergraduate, invented a new kind of hash table, overturning a major conjecture and a long-held hypothesis about the limit to how fast hash tables could operate.
- Read more at Quanta Magazine: https://www.quantamagazine.org/undergraduate-upends-a-40-year-old-data-science-conjecture-20250210/
---------
Quanta Magazine is an editorially independent publication supported by the Simons Foundation. We focus on developments in mathematics, theoretical physics, theoretical computer science and the basic life sciences.
READ free math and science articles on the Quanta website: www.quantamagazine.org
LEARN about the Simons Foundation: www.simonsfoundation.org
FOLLOW our social channels:
- Instagram: quantamag
- Bluesky: @quantamagazine.bsky.social‬
- Facebook: quantanews
- X: quantamagazine