The idea for this book came from the time the authors spent at the Statistics and Applied
Mathematical Sciences Institute (SAMSI) in Research Triangle Park in North Carolina …

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 …

To motivate this survey, we begin with a simple problem that demonstrates a powerful
fundamental idea. Suppose that n balls are thrown into n bins, with each ball choosing a bin …

A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow
membership queries on a set that can be changing dynamically via insertions and deletions …

This article deals with randomized allocation processes placing sequentially n balls into n
bins. We consider multiple-choice algorithms that choose d locations (bins) for each ball at …

Existing oblivious storage systems provide strong security by hiding access patterns, but do
not scale to sustain high throughput as they rely on a central point of coordination. To …

Population protocols are a popular model of distributed computing, in which n agents with
limited local state interact randomly, and cooperate to collectively compute global …

Embedded security systems based on Physical Unclonable Functions (PUFs) offer
interesting protection properties, such as tamper resistance and unclonability. However, to …

This book is a graduate-level textbook on data structures. A data structure is a method1 to
realize a set of operations on some data. The classical example is to keep track of a set of …