"Optimal Bounds for Open Addressing Without Reordering," published last month that sets out how his hash table can find elements faster than was previously considered possible. Hash tables have ...