On the dynamic finger conjecture for splay trees. Part II: The proof

SIAM Journal on Computing

Volumn 30, Issue 1, 2000, Pages 44-85

  Cole, R ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Amortized analysis; Binary search tree; Finger search tree; Splay tree

Indexed keywords

BINARY SEQUENCES; NUMERICAL ANALYSIS; ROOT LOCI; THEOREM PROVING;

AMORTIZED ANALYSIS; BINARY SEARCH TREE; DYNAMIC FINGER CONJECTURE; FINGER SEARCH TREE; SPLAY TREES;

TREES (MATHEMATICS);

EID: 0034455378     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979732699X     Document Type: Article

References (8)

1. On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences
2. Arbitrary splitting in splay trees
3. Canonical forms for competitive binary search tree algorithms
4. Self-adjusting binary search trees
5. Rotation distance, triangulations, and hyperbolic geometry
6. Twists, turns, cascades, deque conjecture, and scanning theorem
7. Sequential access in splay trees takes linear time
8. Lower bounds for accessing binary search trees with rotations