Dynamic optimality - Almost

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

    Research output: Contribution to journalArticle

    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)240-251
    Number of pages12
    JournalSIAM Journal on Computing
    Volume37
    Issue number1
    DOIs
    StatePublished - 2007

    Fingerprint

    Binary Search Tree
    Optimality
    Competitive Ratio
    Trivial

    Keywords

    • Binary search trees
    • Competitiveness
    • Splay trees

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computational Theory and Mathematics
    • Applied Mathematics

    Cite this

    Demaine, E. D., Harmon, D., Iacono, J., & Pǎtraşcu, M. (2007). Dynamic optimality - Almost. SIAM Journal on Computing, 37(1), 240-251. https://doi.org/10.1137/S0097539705447347

    Dynamic optimality - Almost. / Demaine, Erik D.; Harmon, Dion; Iacono, John; Pǎtraşcu, Mihai.

    In: SIAM Journal on Computing, Vol. 37, No. 1, 2007, p. 240-251.

    Research output: Contribution to journalArticle

    Demaine, ED, Harmon, D, Iacono, J & Pǎtraşcu, M 2007, 'Dynamic optimality - Almost', SIAM Journal on Computing, vol. 37, no. 1, pp. 240-251. https://doi.org/10.1137/S0097539705447347
    Demaine ED, Harmon D, Iacono J, Pǎtraşcu M. Dynamic optimality - Almost. SIAM Journal on Computing. 2007;37(1):240-251. https://doi.org/10.1137/S0097539705447347
    Demaine, Erik D. ; Harmon, Dion ; Iacono, John ; Pǎtraşcu, Mihai. / Dynamic optimality - Almost. In: SIAM Journal on Computing. 2007 ; Vol. 37, No. 1. pp. 240-251.
    @article{c85dc4a646ca45698ab17f2a0a084863,
    title = "Dynamic optimality - Almost",
    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.",
    keywords = "Binary search trees, Competitiveness, Splay trees",
    author = "Demaine, {Erik D.} and Dion Harmon and John Iacono and Mihai Pǎtraşcu",
    year = "2007",
    doi = "10.1137/S0097539705447347",
    language = "English (US)",
    volume = "37",
    pages = "240--251",
    journal = "SIAM Journal on Computing",
    issn = "0097-5397",
    publisher = "Society for Industrial and Applied Mathematics Publications",
    number = "1",

    }

    TY - JOUR

    T1 - Dynamic optimality - Almost

    AU - Demaine, Erik D.

    AU - Harmon, Dion

    AU - Iacono, John

    AU - Pǎtraşcu, Mihai

    PY - 2007

    Y1 - 2007

    N2 - 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.

    AB - 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.

    KW - Binary search trees

    KW - Competitiveness

    KW - Splay trees

    UR - http://www.scopus.com/inward/record.url?scp=40049109344&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=40049109344&partnerID=8YFLogxK

    U2 - 10.1137/S0097539705447347

    DO - 10.1137/S0097539705447347

    M3 - Article

    VL - 37

    SP - 240

    EP - 251

    JO - SIAM Journal on Computing

    JF - SIAM Journal on Computing

    SN - 0097-5397

    IS - 1

    ER -