34 citations · 52 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering
Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul
First introduced in 1954, linear probing is one of the oldest data structures in computer science, and due to its unrivaled data locality, it continues to be one of the fastest has…
cs.DS2007
Optimal Cache-Oblivious Mesh Layouts
Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng +1
A mesh is a graph that divides physical space into regularly-shaped regions. Meshes computations form the basis of many applications, e.g. finite-element methods, image rendering,…