In a 1985 paper, the computer scientist Andrew Yao, who would go on to win the A.M. Turing Award, asserted that among hash tables with a specific set of properties, the best way to find an individual element or an empty spot is to just go through potential spots randomly—an approach known as…
Undergraduate Disproves 40-Year-Old Conjecture, Invents New Kind of Hash Table
