We present a simple dictionary with worst case constant lookup time, equaling the
theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et …

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 …

Cuckoo hashing holds great potential as a high-performance hashing scheme for real
applications. Up to this point, the greatest drawback of cuckoo hashing appears to be that …

Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to
yield the desired theoretical guarantees are often neither simple nor practical. Here we show …

We consider the problem of computing the intersection of private datasets of two parties,
where the datasets contain lists of elements taken from a large domain. This problem has …

We show that 4-universal hashing can be implemented efficiently using tabulated 4-
universal hashing for characters, gaining a factor of 5 in speed over the fastest existing …

We study a particular aspect of the balanced allocation paradigm (also known as the “two-
choices paradigm”): constant sized bins, packed as tightly as possible. Let d≥ 1 be fixed …

The performance of a dynamic dictionary is measured mainly by its update time, lookup time,
and space consumption. In terms of update time and lookup time there are known …

Abstract We generalize Cuckoo Hashing to d-ary Cuckoo Hashing and show how this yields
a simple hash table data structure that stores n elements in (1+ ε) n memory cells, for any …

Hashing is fundamental to many algorithms and data structures widely used in practice. For
theoretical analysis of hashing, there have been two main approaches. First, one can …