Abstract

Abstract. At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Derryberry et al. As part of their results, Demaine et al. considered GreedyFuture, an offline BST algorithm that greedily rearranges the search path to minimize the cost of future searches. They showed that GreedyFuture is actually an online algorithm in their geometric view, and that there is a way to turn GreedyFuture into an online BST algorithm with only a constant factor increase in total search cost. Demaine et al. conjectured this algorithm was dynamically optimal, but no upper bounds were given in their paper. We prove the first non-trivial upper bounds for the cost of search operations using GreedyFuture including giving an access lemma similar to that found in Sleator and Tarjan’s classic paper on splay trees. 1

Citations

334	Self-adjusting binary search trees - SLEATOR, E - 1985
36	A.: On the dynamic finger conjecture for splay trees. Part I: Splay sorting log n-block sequences - Cole, Mishra, et al. - 2000
29	Lower bounds for accessing binary search trees with rotations - Wilber - 1989
27	Sequential access in splay trees takes linear time - Tarjan - 1985
11	On the sequential access theorem and deque conjecture for splay trees - Elmasry
11	Canonical forms for competitive binary search tree algorithms - Lucas - 1988
8	M.: Dynamic optimality–almost - Demaine, Harmon, et al. - 2007
8	On the competitiveness of linear search - Munro
7	Key independent optimality - Iacono - 2005
6	C.C.: A lower bound framework for binary search trees with rotations - Derryberry, Sleator, et al. - 2005
5	M.: The geometry of binary search trees - Demaine, Harmon, et al. - 2009
3	Multi-Splay Trees - Wang - 2006
2	R.: An O(log log n)-competitive binary search tree with optimal worst-case access times - Bose, Douïeb, et al.
1	M.: On dynamic optimality for binary search trees - Goyal, Gupta - 2011
1	D.D.: O(log log n)-competitive binary search trees - Wang, Derryberry, et al. - 2006