Worst-case Complexity

Worst-Case Complexity is the asymptotic upper bound on the computational resource usage of an algorithm, defined as the maximum number of steps required over all possible inputs of a given size, distinguishing it from average-case or best-case analyses by focusing on the most unfavorable input scenario.

1.2K

Publications

72.4K

Citations

2.2K

Authors

736

Institutions

Publications per year

2017–2026

163

Authors

2.2K

  1. CC
    Coralia Cartis

    University of Oxford, United Kingdom

    10 publications · 476 citations

    10

    h-index

  2. LN
    L. N. Vicente

    University of Coimbra, Portugal

    7 publications · 373 citations

    7

    h-index

  3. PL
    Philippe L. Toint

    University of Namur, Belgium

    7 publications · 489 citations

    7

    h-index

  4. NI
    Nicholas I. M. Gould

    Rutherford Appleton Laboratory, United Kingdom

    7 publications · 364 citations

    7

    h-index

  5. LT
    Luca Trevisan

    University of California, Berkeley, United States

    6 publications · 476 citations

    6

    h-index

1–5 of 2.2K

Venues

  1. SIAM Journal on Computing

    58 publications · 6.9K citations

    38

    h-index

  2. arXiv (Cornell University)

    Repository · 40 publications · 1.1K citations

    20

    h-index

  3. SIAM Journal on Optimization

    22 publications · 1K citations

    19

    h-index

  4. Journal of the ACM

    JACM · 19 publications · 3.4K citations

    18

    h-index

  5. Mathematical Programming

    16 publications · 985 citations

    13

    h-index

1–5