Dynamic Optimality–Almost
Cached
Download Links
by
Erik D. Demaine
,
Dion Harmon
,
John Iacono
| Venue: | Proc. 45th Annu. IEEE Sympos. Foundations Comput. Sci |
| Citations: | 8 - 1 self |
BibTeX
@INPROCEEDINGS{Demaine_dynamicoptimality–almost,
author = {Erik D. Demaine and Dion Harmon and John Iacono},
title = {Dynamic Optimality–Almost},
booktitle = {Proc. 45th Annu. IEEE Sympos. Foundations Comput. Sci},
year = {},
pages = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1.
