loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)
Dynamic Optimality — Almost
Rome, Italy
October 17-October 19
ISBN: 0-7695-2228-9
Erik D. Demaine, Massachusetts Institute of Technology
Dion Harmon, Massachusetts Institute of Technology
John Iacono, Polytechnic University
Mihai Pătraşcu, Massachusetts Institute of Technology
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.
Citation:
Erik D. Demaine, Dion Harmon, John Iacono, Mihai Pătraşcu, "Dynamic Optimality — Almost," focs, pp.484-490, 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.