Self-adjusting binary search trees
Journal of the ACM (JACM)
Lower bounds for accessing binary search trees with rotations
SIAM Journal on Computing
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
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
SIAM Journal on Computing
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
SIAM Journal on Computing
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
SIAM Journal on Computing
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying
Information Processing Letters
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
De-amortizing binary search trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We present skip-splay, the first binary search tree algorithm known to have a running time that nearly achieves the unified bound. Skip-splay trees require only O (m lg lg n + UB (*** )) time to execute a query sequence *** = *** 1 ... *** m . The skip-splay algorithm is simple and similar to the splay algorithm.