A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
Huacheng Yu's team later proved that the Bender et al.'s hash table was as efficient as any data structure could possibly be, marking the end of decades-long efforts to solve Peterson's problem regarding the optimal balance between time and space efficiency in hash tables.
