@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}
}

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.