This paper by Martin Farach-Colton, Andrew Krapivin and William Kuszmaul shook the computer science interwebs last year as it proposed a much faster implementation for hash maps. An important disclaimer: unless you are way more bewandered in data structures than me, you're forgiven to believe that this paper revolutionises mainstream hash map implementations like the … Continue reading OPAW: Optimal Bounds for Open Addressing Without Reordering →