From a while back: [Wayback/Archive] Undergraduate Upends a 40-Year-Old Data Science Conjecture : programming which has a “TL;DR for non CS people” and a “Here’s an explanation” well worth reading.
It’s about the work of Andrew Krapivin with co-authors Martín Farach-Colton and William Kuszmaul.
A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
Reminder to self to find any real world implementations of this new hashing algorithm.
Materials are the “easier” article [Wayback/Archive] Undergraduate Upends a 40-Year-Old Data Science Conjecture | Quanta Magazine which refers to the actual paper:
The Wiert Corner - irregular stream of stuff 