Corpus ID: 9252938

The landscape of bounds for binary search trees

@article{Chalermsook2016TheLO,
  title={The landscape of bounds for binary search trees},
  author={Parinya Chalermsook and M. Goswami and L. Kozma and K. Mehlhorn and Thatchaphol Saranurak},
  journal={ArXiv},
  year={2016},
  volume={abs/1603.04892}
}
  • Parinya Chalermsook, M. Goswami, +2 authors Thatchaphol Saranurak
  • Published 2016
  • Computer Science, Mathematics
  • ArXiv
  • Binary search trees (BSTs) with rotations can adapt to various kinds of structure in search sequences, achieving amortized access times substantially better than the Theta(log n) worst-case guarantee. Classical examples of structural properties include static optimality, sequential access, working set, key-independent optimality, and dynamic finger, all of which are now known to be achieved by the two famous online BST algorithms (Splay and Greedy). (...) In this paper, we introduce novel… CONTINUE READING
    Binary search trees, rectangles and patterns
    4
    Belga B-Trees
    Belga B-trees
    New Paths from Splay to Dynamic Optimality
    1
    Push-Down Trees: Optimal Self-Adjusting Complete Trees
    5

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES
    A review of position tracking' 1st Int Conference on Sensing Technology
    • 2005
    Workflow Modeling Using Proclets
    93
    Extremal functions of forbidden multidimensional matrices
    17
    Algorithms And Data Structures The Basic Toolbox
    68
    Static optimality for splay trees. http://11011110.livejournal.com/ 131530.html
    • 2016