Geometric shapes are identified with their features. For computational purposes a concrete
mathematical definition of features is required. In this paper we use a topological approach …

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 …

Abstract The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive
(within a constant competitive factor) among the class of all binary search tree (BST) …

Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search
trees (BST). In this context, we study the skip list data structure introduced by Pugh [35]. We …

We present a new connection between self-adjusting binary search trees (BSTs) and heaps,
two fundamental, extensively studied, and practically relevant families of data structures …

We introduce a new technique to bound the asymptotic performance of splay trees. The
basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree as …

We present a dynamic comparison-based search structure that supports insertions,
deletions, and searches within the unified bound. The unified bound specifies that it is quick …

At SODA 2009, Demaine et al. presented a novel connection between binary search trees
(BSTs) and subsets of points on the plane. This connection was independently discovered …

In this paper we improve, reprove, and simplify several theorems on the performance of data
structures based on path compression and search trees. We apply a technique very familiar …

In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon,
Iacono, Kane, and Pǎtraşcu (DHIKP) to accommodate for insertions and deletions. Within …