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

BeigeAgenda@lemmy.ca ⁨2⁩ ⁨weeks⁩ ago

Here’s a link to the paper “Tiny Pointers” arxiv.org/pdf/2111.12800 those editors at Quantamagazine writes their summary in a strange fashion, for instance using x in stead of n which is normally used in computer science when talking about big O notation.

source
Sort:hotnewtop