Cat@ponder.cat to Technology@lemmy.worldEnglish · 12 days agoA young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.www.quantamagazine.orgexternal-linkmessage-square50fedilinkarrow-up1380arrow-down119cross-posted to: [email protected]
arrow-up1361arrow-down1external-linkA young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.www.quantamagazine.orgCat@ponder.cat to Technology@lemmy.worldEnglish · 12 days agomessage-square50fedilinkcross-posted to: [email protected]
minus-squaretyler@programming.devlinkfedilinkEnglisharrow-up3·11 days agoTiny Pointers was the paper that the student read to get the idea. The paper he co-authored was “Optimal Bounds for Open Addressing Without Reordering”
Tiny Pointers was the paper that the student read to get the idea. The paper he co-authored was “Optimal Bounds for Open Addressing Without Reordering”