Undergraduate Upends a 40-Year-Old Data Science Conjecture
A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible. The post Undergraduate Upends a 40-Year-Old Data Science Conjecture first appeared on Quanta Magazine
Sometime in the fall of 2021, Andrew Krapivin, an undergraduate at Rutgers University, encountered a paper that would change his life. At the time, Krapivin didn’t give it much thought. But two years later, when he finally set aside time to go through the paper (“just for fun,” as he put it), his efforts would lead to a rethinking of a widely used tool in computer science. The paper’s title…
