Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying

Authors:
George F. Georgakopoulos
Affiliations:
Department of Computer Science, University of Crete, Knossou Av., GR-71409, Heraklion, Crete, Greece
Venue:
Information Processing Letters
Year:
2008

Citing 19
Cited 4

Self-adjusting binary search trees

Journal of the ACM (JACM)
Lower bounds for accessing binary search trees with rotations

SIAM Journal on Computing
Self-adjusting multi-way search trees

Information Processing Letters
Self-adjusting k-ary search trees

Journal of Algorithms
An explanation of splaying

Journal of Algorithms
Randomized splay trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Self-Organizing Binary Search Trees

Journal of the ACM (JACM)
Design of Dynamic Data Structures

Design of Dynamic Data Structures
Static optimality and dynamic search-optimality in lists and trees

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences

SIAM Journal on Computing
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof

SIAM Journal on Computing
Key Independent Optimality

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Path Balance Heuristic for Self-Adjusting Binary Search Trees

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Self-Organizing Data Structures

Developments from a June 1996 seminar on Online algorithms: the state of the art
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees

Journal of Algorithms
Dynamic Optimality " Almost

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
O(log log n)-competitive dynamic binary search trees

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sphendamnœ: a proof that k-splay fails to achieve logk N behaviour

PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
How to splay for loglogn-competitiveness

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Skip-Splay: Toward Achieving the Unified Bound in the BST Model

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An O(log log n)-competitive binary search tree with optimal worst-case access times

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
De-amortizing binary search trees

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A self-adjusting data structure for multidimensional point sets

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an extension of the splay technique, the chain-splay. Chain-splay trees 'splay' the accessed element to the root as classical splay trees do, but also perform some local 'house-keeping' splay operations below the accessed element. We prove that chain-splay is loglogN-competitive to any off-line algorithm that maintains a binary search tree with rotations. This result is the nearest point to the dynamic optimality that splay trees have reached since 1983.