De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Hi-index | 0.00 |
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.