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 · 18 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.

taladar · 15 hours ago

Also never even start optimizing until you profile and are sure the bit you are trying to optimize even matters to the overall performance of your program.

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