Dynamic optimality - Almost

Erik D. Demaine, Dion Harmon, John Iacono, Mihai Pǎtraşcu

    Research output: Contribution to journalConference article

    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.

    Original languageEnglish (US)
    Pages (from-to)484-490
    Number of pages7
    JournalProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
    StatePublished - Dec 1 2004
    EventProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy
    Duration: Oct 17 2004Oct 19 2004

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Demaine, E. D., Harmon, D., Iacono, J., & Pǎtraşcu, M. (2004). Dynamic optimality - Almost. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 484-490.