- Record: found
- Abstract: not found
- Book Chapter: not found
Algorithms and Data Structures
Skip-Splay: Toward Achieving the Unified Bound in the BST Model
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references8
- Record: found
- Abstract: not found
- Article: not found
Self-adjusting binary search trees
Daniel Sleator, Robert Tarjan (1985)
- Record: found
- Abstract: not found
- Article: not found
Lower Bounds for Accessing Binary Search Trees with Rotations
Robert Wilber (1989)
- Record: found
- Abstract: not found
- Article: not found
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
Richard Cole (2000)
