Sciweavers

Share
FOCS
2004
IEEE

Dynamic Optimality -- Almost

11 years 5 months ago
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.
Erik D. Demaine, Dion Harmon, John Iacono, Mihai P
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where FOCS
Authors Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
Comments (0)
books