1 Department of Computer Science, Faculty of Science, Aarhus University, Aarhus University2 unknown
We present a simple and efficient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of the scheme is backed by extensive experiments and comparisons with known methods, showing it to be quite competitive also in the average case.
Algorithms - Esa 2001: Lecture Notes in Computer Science, 2001, p. 300-311