Skip to main content
Springer Nature Link
Log in

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

  • Conference paper
Algorithms and Data Structures (WADS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5664))

Included in the following conference series:

  • 1420 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. Journal of the ACM 32, 652–686 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Wilber, R.: Lower bounds for accessing binary search trees with rotations. SIAM Journal on Computing 18(1), 56–67 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cole, R., Mishra, B., Schmidt, J.P., Siegel, A.: On the dynamic finger conjecture for splay trees, part I: Splay sorting log n-block sequences. SIAM Journal on Computing 30(1), 1–43 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cole, R.: On the dynamic finger conjecture for splay trees, part II: The proof. SIAM Journal on Computing 30(1), 44–85 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Iacono, J.: Alternatives to splay trees with o(log n) worst-case access times. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, pp. 516–522. Society for Industrial and Applied Mathematics (2001)

    Google Scholar 

  6. Bădoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theoretical Computer Science 382(2), 86–96 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Demaine, E.D., Harmon, D., Iacono, J., Pǎtraşcu, M.: Dynamic optimality—almost. SIAM Journal on Computing 37(1), 240–251 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Wang, C.C., Derryberry, J., Sleator, D.D.: O(log log n)-competitive dynamic binary search trees. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms, pp. 374–383. ACM, New York (2006)

    Google Scholar 

  9. Georgakopoulos, G.F.: Chain-splay trees, or, how to achieve and prove loglogn-competitiveness by splaying. Information Processing Letters 106(1), 37–43 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Carnegie Mellon University, USA

    Jonathan C. Derryberry & Daniel D. Sleator

Authors
  1. Jonathan C. Derryberry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel D. Sleator
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carleton University, Ottawa, Canada

    Frank Dehne

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  3. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, P.O. Box, K1S 5B6, Ontario, Canada

    Jörg-Rüdiger Sack

  4. University of Calgary, Calgary, AB, Canada

    Csaba D. Tóth

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Derryberry, J.C., Sleator, D.D. (2009). Skip-Splay: Toward Achieving the Unified Bound in the BST Model. In: Dehne, F., Gavrilova, M., Sack, JR., Tóth , C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03367-4_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03367-4_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03366-7

  • Online ISBN: 978-3-642-03367-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation