On the Dynamic Finger Conjecture for Splay Trees Part I: Splay Sorting log n-Block Sequences

Authors:
R. Cole;B. Mishra;J. Schmidt;A. Siegel
Affiliations:
-;-;-;-
Venue:
On the Dynamic Finger Conjecture for Splay Trees Part I: Splay Sorting log n-Block Sequences
Year:
1995

On the dynamic finger conjecture for splay trees

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Unique binary search tree representations and equality-testing of sets and sequences

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the efficiency of pairing heaps and related data structures

Journal of the ACM (JACM)
Alternatives to splay trees with O(log n) worst-case access times

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Randomized splay trees: theoretical and experimental results

Information Processing Letters
Improved Upper Bounds for Pairing Heaps

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Queaps

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation

Hi-index	0.01

A special case of the Dynamic Finger Conjecture is proved; this special case introduces a number of useful techniques.