An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

@inproceedings{Bose2010AnON,
  title={An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times},
  author={Prosenjit Bose and Karim Dou{\"i}eb and Vida Dujmovic and Rolf Fagerberg},
  booktitle={SWAT},
  year={2010}
}
  • Prosenjit Bose, Karim Douïeb, +1 author Rolf Fagerberg
  • Published in SWAT 2010
  • Mathematics, Computer Science
  • We present the zipper tree, an O(log log n)-competitive online binary search tree that performs each access in O(logn) worst-case time. This shows that for binary search trees, optimal worst-case access time and near-optimal amortized access time can be guaranteed simultaneously. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-7 OF 7 CITATIONS

    Push-Down Trees: Optimal Self-Adjusting Complete Trees

    VIEW 1 EXCERPT
    CITES BACKGROUND

    De-amortizing Binary Search Trees

    VIEW 1 EXCERPT
    CITES METHODS

    On Dynamic Optimality for Binary Search Trees

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    Upper Bounds for Maximally Greedy Binary Search Trees

    • Kyle Fox
    • Mathematics, Computer Science
    • WADS
    • 2011
    VIEW 1 EXCERPT
    CITES BACKGROUND

    Adaptive binary search trees

    VIEW 3 EXCERPTS
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES

    Dynamic Optimality - Almost

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Lower Bounds for Accessing Binary Search Trees with Rotations

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Chain-splay trees

    • G. F. Georgakopoulos
    • or, how to achieve and prove loglogncompetitiveness by splaying. Inf. Process. Lett., 106(1):37–43
    • 2008

    On the competitiveness of linear search

    • J. I. Munro
    • Proc. of the 8th Annual European Symposium (ESA), volume 1879 of LNCS, pages 338–345
    • 2000
    VIEW 1 EXCERPT