Abstract
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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
APA
Derryberry, J. C., & Sleator, D. D. (2009). Skip-splay: Toward achieving the unified bound in the BST model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5664 LNCS, pp. 194–205). https://doi.org/10.1007/978-3-642-03367-4_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free