A data structure is said to be strongly history independent if its state is fully determined by its
current set of elements (and random bits). One of the most basic questions that strongly …

We study the basic problem of assigning memoryless workers to tasks with dynamically
changing demands. Given a set of $ w $ workers and a multiset $ T\subseteq [t] $ of $| T|= w …

This thesis revisits some of the oldest and most basic questions in the theory of randomized
data structures—questions such as: How efficient is a linear probing hash table? How fast …