Motivated by the problem of maintaining data structures for a large sets of points that are
evolving over the course of time, we consider the problem of maintaining a set of labels …

We give optimal sorting algorithms in the evolving data framework, where an algorithm's
input data is changing while the algorithm is executing. In this framework, instead of …

Geometric data sets arising in modern applications are often very large and change
dynamically over time. A popular framework for dealing with such data sets is the evolving …

We empirically study sorting in the evolving data model. In this model, a sorting algorithm
maintains an approximation to the sorted order of a list of data items while simultaneously …

Drawing digraphs presents unique challenges that do not occur when drawing undirected
graphs. Many digraphs tend to represent transitive relationships; that is they have a flow …

Sorting is one of the most well studied algorithmic problems in Computer Science. It is a
fundamental building block in many other algorithms. In this dissertation, we consider …

Drawing digraphs presents unique challenges that do not occur when drawing undirected
graphs. Many digraphs tend to represent transitive relationships; that is they have a flow …