We prove nearly tight upper and lower bounds on the maximum number of various rotational operations that can be performed on a binary tree. One of the lower bound results refutes Sleator's turnâ€¦ (More)

A deque with heap order is a linear list of elements with real-valued keys which allows insertions and deletions of elements at both ends of the list. It also allows the ndmin (equivalently ndmax)â€¦ (More)

Given an ordered universe U, we study the problem of representing each subset of U by a unique binary search tree so that dictionary operations can be performed efficiently. We exhibitâ€¦ (More)

We studylazy structure sharing as a tool for optimizing equivalence testing on complex data types. We investigate a number of strategies for implementing lazy structure sharing and provide upper andâ€¦ (More)

The quality of a learning algorithm is characterized by the accuracy, stability and comprehensibility of the models it generates. Though ensembles produce accurate and stable classifiers, they areâ€¦ (More)

This thesis investigates the amortized complexity of some fundamental data structure problems and introduces interesting ideas for proving lower bounds on amortized complexity and for performingâ€¦ (More)