论文信息 - Skip-Splay: Toward Achieving the Unified Bound in the BST Model

Skip-Splay: Toward Achieving the Unified Bound in the BST Model

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.

Daniel Dominic Sleator | Jonathan Derryberry | Jonathan Derryberry | D. Sleator

[1] Richard Cole,et al. On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof , 2000, SIAM J. Comput..

[2] Richard Cole,et al. A unified access bound on comparison-based dynamic dictionaries , 2007, Theor. Comput. Sci..

[3] Robert E. Wilber. Lower Bounds for Accessing Binary Search Trees with Rotations , 1989, SIAM J. Comput..

[4] George F. Georgakopoulos,et al. Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying , 2008, Inf. Process. Lett..

[5] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.

[6] Richard Cole,et al. On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences , 1995, SIAM J. Comput..

[7] Erik D. Demaine,et al. Dynamic Optimality - Almost , 2004, FOCS.

[8] John Iacono,et al. Alternatives to splay trees with O(log n) worst-case access times , 2001, SODA '01.

[9] Daniel Dominic Sleator,et al. O(log log n)-competitive dynamic binary search trees , 2006, SODA '06.