Linear Probing with Constant Independence

Anna Pagh, Rasmus Pagh, Milan Ruzic

Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years it has become one of the most important hash table organizations sinc…