Dynamic Optimality -- Almost

We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator and Tarjan's dynamic optimality conjecture of 1985 that O(1)-competitive binary search trees exist. Key words. Binary search trees, splay trees, competitiveness. AMS subject classification. 68P05; G8P10.

• Type: Conference
• Year: 2004
• Where: FOCS
• Authors: Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
• Keywords: Binary Search Trees, FOCS 2004, Online Binary Search, Tarjan's Dynamic Optimality, Theoretical Computer Science