The Dynamic Optimality Conjecture [ST85] states that splay trees are competitive (with a constant competitive factor) among the class of all binary search tree (BST) algorithms. Despite 20 years of research this conjecture is still unresolved. Recently Demaine et al. [DHIP04] suggested searching for alternative algorithms which have small, but non-constant competitive factors. They proposed tan...

Access requests to keys stored into a data structure often exhibit locality of reference in practice. Such a regularity can be modeled, e.g., by working sets. In this paper we study to what extent can the existence of working sets be taken advantage of in splay trees. In order to reduce the number of costly splay operations we monitor for information on the current working set and its change. W...

We give a new, simple proof for the sequential access theorem for splay trees. For an n-node splay tree, our bound on the number of rotations is 4:5n, with a smaller constant than the bound of 10:8n concluded by Tarjan. We extend our proof to prove the deque conjecture for output-restricted deques. Our proofs provide additional insights into the workings of splay trees. c © 2004 Elsevier B.V. A...

Restoration of sustainable geomorphic processes that create floodplain topography through development of sand-splay complexes at intentional breaches is one method to promote variability in physical structure needed for habitat restoration. The topography of splay complexes provides a range of floodplain elevations that creates local variability in (i) inundation duration and frequency and dept...

Glucose titration studies were performed in rats with unilateral chronic pyelonephritis before and after removal of the contralateral control kidneys. Identical studies were performed in animals with unilateral partial renal infarction in which the experimental kidneys had a marked reduction in nephron population but no anatomic deformation in the surviving nephrons. In the initial studies, bot...

Using dynamic light scattering, we study orientational fluctuation modes in the nematic phase of a self-assembled lyotropic chromonic liquid crystal (LCLC) disodium cromoglycate and measure the Frank elastic moduli and viscosity coefficients. The elastic moduli of splay (K1) and bend (K3) are in the order of 10 pN while the twist modulus (K2) is an order of magnitude smaller. The splay constant...

In this paper we present new empirical results for splay trees. These results provide a better understanding of how cache performance affects query execution time. Our results show that splay trees can have faster lookup times compared with randomly built binary search trees (BST) under certain settings. In contrast, previous experiments have shown that because of the instruction overhead invol...

In this thesis, we introduce multi-splay trees (MSTs) and prove several results demonstrating that MSTs have most of the useful properties different BSTs have. First, we prove a close variant of the splay tree access lemma [ST85] for multi-splay trees, a lemma that implies MSTs have the O(log n) runtime property, the static finger property, and the static optimality property. Then, we extend th...