How to splay for loglogn-competitiveness

Authors:
George F. Georgakopoulos
Affiliations:
Dept. of Computer Science, University of Crete, Heraklion, Crete, Greece
Venue:
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Year:
2005

Citing 17
Cited 3

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)
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
Twists, turns, cascades, deque conjecture, and scanning theorem

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Sphendamnœ: a proof that k-splay fails to achieve logk N behaviour

PCI'01 Proceedings of the 8th Panhellenic conference on Informatics

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

Information Processing Letters
Dynamic optimality for skip lists and B-trees

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Splay trees, Davenport-Schinzel sequences, and the deque conjecture

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an extension of the splay technique, the chain-splay. Chain-splay trees splay the accessed element to the root exactly as classic 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 searching algorithm. This result is the nearest point to dynamic optimality of splay trees reached since 1983.