Average-case Analysis

Average-Case Analysis is a method in algorithm analysis that characterizes the expected performance of a sorting algorithm under typical input conditions by averaging its behavior over all possible inputs of a given size.

184

Publications

11.5K

Citations

298

Authors

183

Institutions

Publications per year

2017–2026

14

Authors

298

  1. PW
    Peter W. Shor

    AT&T (United States), United States

    11 publications · 526 citations

    10

    h-index

  2. PF
    Philippe Flajolet

    Institut national de recherche en sciences et technologies du numérique, France

    9 publications · 350 citations

    9

    h-index

  3. EG
    E. G. Coffman

    AT&T (United States), United States

    7 publications · 260 citations

    7

    h-index

  4. RS
    Robert Sedgewick

    Brown University, United States

    7 publications · 164 citations

    7

    h-index

  5. GS
    George S. Lueker

    University of California, Irvine, United States

    6 publications · 246 citations

    6

    h-index

1–5 of 298

Venues

  1. Algorithmica

    7 publications · 219 citations

    7

    h-index

  2. Theoretical Computer Science

    5 publications · 167 citations

    5

    h-index

  3. arXiv (Cornell University)

    Repository · 5 publications · 128 citations

    5

    h-index

  4. OpenGrey (Institut de l'Information Scientifique et Technique)

    Repository · 4 publications · 75 citations

    4

    h-index

  5. Journal of Complexity

    4 publications · 60 citations

    4

    h-index

1–5