Two-Way Chaining with Reassignment

Authors:

Abstract
We present an algorithm for hashing $\lfloor \alpha n \rfloor$ elements into a table with n separate chains that requires O(1) deterministic worst-case insert time and O(1) expected worst-case search time for constant $\alpha$. We exploit the connection between two-way chaining and random graph theory in our techniques.

This publication has 18 references indexed in Scilit: