A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
Undergraduate Upends a 40-Year-Old Data Science Conjecture from Steve Nadis

A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.