Andrew Krapivin Rethinks Tiny Pointers

This is a news story, published by Wired, that relates primarily to Andrew Krapivin news.

Andrew Krapivin news

For more Andrew Krapivin news, you can click here:

more Andrew Krapivin news

News about Ai research

For more Ai research news, you can click here:

more Ai research news

Wired news

For more news from Wired, you can click here:

more news from Wired

About the Otherweb

Otherweb, Inc is a public benefit corporation, dedicated to improving the quality of news people consume. We are non-partisan, junk-free, and ad-free. We use artificial intelligence (AI) to remove junk from your news feed, and allow you to select the best tech news, business news, entertainment news, and much more. If you like this article about Ai research, you might also like this article about

Tiny Pointers

. We are dedicated to bringing you the highest-quality news, junk-free and ad-free, about your favorite topics. Please come every day to read the latest less memory news, memory news, news about Ai research, and other high-quality news about any topic that interests you. We are working hard to create the best news aggregator on the web, and to put you in control of your news feed - whether you choose to read the latest news through our website, our news app, or our daily newsletter - all free!

Pointers

Wired

•

Technology

Undergraduate Upends a 40-Year-Old Data Science Conjecture

Summary

Nutrition label

85% Informative

Andrew Krapivin upended the common thinking around hash tables, one of the best-studied tools in computer science.

The first hash tables date back to the early 1950s , and computer scientists have studied and used them ever since.

The new hash table can indeed find elements faster than was considered possible.

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 go through potential spots randomly.

He also stated that, in the worst-case scenario, where you’re searching for the last remaining open spot, you can never do better than x.

For 40 years , most computer scientists assumed that Yao ’s conjecture was true.

VR Score

Informative language

Neutral language

Article tone

informal

Language

English

Language complexity

Offensive language

not offensive