Greedy Is an Almost Optimal Deque

@inproceedings{Chalermsook2015GreedyIA,
  title={Greedy Is an Almost Optimal Deque},
  author={Parinya Chalermsook and M. Goswami and L. Kozma and K. Mehlhorn and Thatchaphol Saranurak},
  booktitle={WADS},
  year={2015}
}
  • Parinya Chalermsook, M. Goswami, +2 authors Thatchaphol Saranurak
  • Published in WADS 2015
  • Mathematics, Computer Science
  • In this paper we extend the geometric binary search tree (BST) model of Demaine, Harmon, Iacono, Kane, and Pǎtrascu (DHIKP) to accommodate for insertions and deletions. Within this extended model, we study the online Greedy BST algorithm introduced by DHIKP. Greedy BST is known to be equivalent to a maximally greedy (but inherently offline) algorithm introduced independently by Lucas in 1988 and Munro in 2000, conjectured to be dynamically optimal. 
    5 Citations
    Binary search trees, rectangles and patterns
    • 5
    Pattern-Avoiding Access in Binary Search Trees
    • 23
    • PDF
    Smooth heaps and a dual view of self-adjusting data structures
    • 5
    • PDF

    References

    SHOWING 1-10 OF 21 REFERENCES
    Upper Bounds for Maximally Greedy Binary Search Trees
    • K. Fox
    • Mathematics, Computer Science
    • WADS
    • 2011
    • 19
    • PDF
    The geometry of binary search trees
    • 61
    • Highly Influential
    • PDF
    In Pursuit of the Dynamic Optimality Conjecture
    • J. Iacono
    • Mathematics, Computer Science
    • Space-Efficient Data Structures, Streams, and Algorithms
    • 2013
    • 22
    • PDF
    On the sequential access theorem and deque conjecture for splay trees
    • A. Elmasry
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 2004
    • 31
    • PDF
    On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
    • R. Cole
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 2000
    • 130
    • PDF
    On the Competitiveness of Linear Search
    • 50
    On the dynamic finger conjecture for splay trees
    • R. Cole
    • Mathematics, Computer Science
    • STOC '90
    • 1990
    • 77
    Sequential access in splay trees takes linear time
    • R. Tarjan
    • Mathematics, Computer Science
    • Comb.
    • 1985
    • 104
    • Highly Influential
    On the deque conjecture for the splay algorithm
    • R. Sundar
    • Mathematics, Computer Science
    • Comb.
    • 1992
    • 48
    Splay trees, Davenport-Schinzel sequences, and the deque conjecture
    • 44
    • PDF