Let S be a set of n distinct keys belonging to some universe U. We would like to store the
keys of S so that membership queries of the form “Is x in S?” can be answered quickly. This …

Private information retrieval (PIR) is a key building block in many privacy-preserving
systems. Unfortunately, existing constructions remain very expensive. This paper introduces …

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 …

The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic
set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is …

We describe a methodology for constructing parallel algorithms that are transportable
among parallel computers having different numbers of processors, different bandwidths of …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

We present a randomized simulation of an log log (n) log (n)-processor shared memory
machine (DMM) with optimal expected delay O (log log (n)) per step of simulation. The time …

We obtain matching upper and lower bounds for the amount of time to find the predecessor
of a given element among the elements of a fixed compactly stored set. Our algorithms are …

A new algorithm for generating order preserving minimal perfect hash functions is
presented. The algorithm is probabilistic, involving generation of random graphs. It uses …