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

Cat@ponder.cat · 20 hours ago

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

rockSlayer@lemmy.world · 18 hours ago

Infrastructural APIs are much slower to change, and in a lot of cases the use of those APIs are dependent on a specific version. The change will definitely occur over time as the practical limitations are discovered

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

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 | Quanta Magazine