The predecessor problem is a key component of the fundamental sorting-and-searching
core of algorithmic problems. While binary search is the optimal solution in the comparison …

Hash tables are a ubiquitous class of dictionary data structures. However, standard hash
table implementations do not translate well into the external memory model, because they …

Dictionaries remain the most well studied class of data structures. A dictionary supports
insertions, deletions, membership queries, and usually successor, predecessor, and extract …

The fundamental problems of sorting and searching, traditionally studied in the unit-cost
comparison model, have been generalized to include priced information, where different …

UNDERSTANDING DICTIONARIES AT THE INTERSECTION OF THEORY AND PRACTICE
Page 1 UNDERSTANDING DICTIONARIES AT THE INTERSECTION OF THEORY AND …

Turán's Theorem gives an upper bound on the number of edges of n-node, K r-free graphs,
or equivalently it can be restated as that every n-node, m-edge graph has an independent …

(1) Centralized algorithms for massive data sets: This mainly includes approximate and
adaptive data structures for databases, and external memory data structures.(2) Networks …

Chapter 2 is based on unpublished joint work with Michael A. Bender, Jeremy T. Fineman,
Seth Gilbert, and Tsvi Kopelowitz. Chapter 3 is based on work presented at the 38th …