Online Competitive Analysis

Online Competitive Analysis is a theoretical framework in algorithm design that evaluates the performance of online algorithms by comparing their solution quality to that of an optimal offline algorithm under worst-case scenarios, distinguishing it from probabilistic or average-case analysis methods.

27

Publications

936

Citations

58

Authors

27

Institutions

Publications per year

2017–2026

5

Authors

58

  1. SC
    Shahar Chen

    Technion – Israel Institute of Technology, Israel

    3 publications · 89 citations

    3

    h-index

  2. NB
    Niv Buchbinder

    Technion – Israel Institute of Technology, Israel

    3 publications · 89 citations

    3

    h-index

  3. JN
    Joseph Naor

    Technion – Israel Institute of Technology, Israel

    3 publications · 89 citations

    3

    h-index

  4. SS
    Stefan Schmid

    Technische Universität Berlin, Germany

    2 publications · 45 citations

    2

    h-index

  5. OM
    Olaf Maurer

    Technische Universität Berlin, Germany

    2 publications · 26 citations

    2

    h-index

1–5 of 58

Venues

  1. ACM Transactions on Algorithms

    TALG · 2 publications · 49 citations

    2

    h-index

  2. 1

    h-index

  3. Max Planck Digital Library

    Repository · 1 publications · 17 citations

    1

    h-index

  4. International Journal of Foundations of Computer Science

    IJFCS · 1 publications · 20 citations

    1

    h-index

  5. Journal of Industrial and Management Optimization

    JIMO · 1 publications · 14 citations

    1

    h-index

1–5