On the sequential access theorem and deque conjecture for splay trees

Authors:
Amr Elmasry
Affiliations:
Computer Science Department, Alexandria University, Alexandria, Egypt
Venue:
Theoretical Computer Science
Year:
2004

Citing 2
Cited 9

Self-adjusting binary search trees

Journal of the ACM (JACM)
Sequential access in splay trees takes linear time

Combinatorica

O(log log n)-competitive dynamic binary search trees

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A unified access bound on comparison-based dynamic dictionaries

Theoretical Computer Science
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
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Upper bounds for maximally greedy binary search trees

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A unifying property for distribution-sensitive priority queues

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
A priority queue with the time-finger property

Journal of Discrete Algorithms
A self-adjusting data structure for multidimensional point sets

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

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.