On the Dynamic Finger Conjecture for Splay Trees Part II: The Proof

Authors:
R. Cole
Affiliations:
-
Venue:
On the Dynamic Finger Conjecture for Splay Trees Part II: The Proof
Year:
1995

Citing 0
Cited 7

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
Space-efficient finger search on degree-balanced search trees

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
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
Data streams: algorithms and applications

Foundations and Trends® in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The following result is shown: On an n-node splay tree, the amortized cost of an access at distance d from the preceding access is O(log (d+1)). In addition, there is an O(n) initialization cost. The accesses include searches, insertions and deletions.