A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
By Steve Nadis, Contributing Writer to Quanta Magazine, February 10, 2025
Sometime in the fall of 2021, Andrew Krapivin, an undergraduate at Rutgers University, encountered a paper that would change his life...
Read the full article in Quanta Magazine. This article was reprinted in Wired on March 16, 2025.
Photo: Phillip Ammon for Quanta Magazine
Honors College alum Andrew Krapivin ('24, SAS/HC) was awarded the Churchill Scholarship as a senior, the first at Rutgers in a decade, and now attends the University of Cambridge in England. He was also named a Goldwater Scholar as a junior.