A Sharp Analysis of Fixed Offset Hash Tables
This work considers the class of open addressing hash tables that uses a fixed offset sequence that uses a fixed offset sequence $r_0,r_1,\ldots,r_{n-1}$ to find an open slot in the table and gives a simple analysis that the expected insertion time when the load factor is 1-\epsilon is O(\epsilon^{-2})$.