Many emerging arboviruses are not transmitted by traditional mosquito vectors, but by lesser-
studied arthropods such as ticks, midges, and sand flies. Small RNA (sRNA) silencing …

Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs),
allowing the efficient exploration of tree-structured domains.(BSTs are the special case in …

The dynamic optimality conjecture is perhaps the most fundamental open question about
binary search trees (BST). It postulates the existence of an asymptotically optimal online …

We consider the design of adaptive data structures for searching elements of a tree-
structured space. We use a natural generalization of the rotation-based online binary search …

Consider the task of performing a sequence of searches in a binary search tree. After each
search, an algorithm is allowed to arbitrarily restructure the tree, at a cost proportional to the …

Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search
sequences, achieving amortized access times substantially better than the Theta (log n) …

The topic of this thesis is the classical problem of searching for a sequence of keys in a
binary search tree (BST), allowing the re-arrangement of the tree after every search. Our …

The long-standing dynamic optimality conjecture postulates the existence of a dynamic
binary search tree (BST) that is O (1)-competitive to all other dynamic BSTs. Despite …

The access lemma (Sleator and Tarjan, JACM 1985) is a property of binary search trees that
implies interesting consequences such as static optimality, static finger, and working set …

We revisit multipass pairing heaps and path-balanced binary search trees (BSTs), two
classical algorithms for data structure maintenance. The pairing heap is a simple and …