Comparison Complexity

Comparison Complexity is a theoretical measure in the analysis of sorting algorithms that quantifies the number of pairwise comparisons required to sort a given set of elements, distinguishing it from other complexity measures by focusing exclusively on comparison operations as the fundamental computational step.

118

Publications

4.9K

Citations

219

Authors

116

Institutions

Publications per year

2017–2026

9

Variants

Comparison-based Complexity

Authors

219

  1. UZ
    Uri Zwick

    Tel Aviv University, Israel

    6 publications · 181 citations

    6

    h-index

  2. AC
    Andrew Chi-Chih Yao

    Princeton University, United States

    4 publications · 106 citations

    4

    h-index

  3. RC
    Richard Cole

    New York University, United States

    4 publications · 165 citations

    4

    h-index

  4. JA
    James Allen Fill

    Johns Hopkins University, United States

    4 publications · 67 citations

    4

    h-index

  5. RL
    Ronald L. Rivest

    Massachusetts Institute of Technology, United States

    3 publications · 338 citations

    3

    h-index

1–5 of 219

Venues

  1. SIAM Journal on Computing

    25 publications · 1.9K citations

    20

    h-index

  2. ACM Transactions on Algorithms

    TALG · 5 publications · 184 citations

    5

    h-index

  3. IEEE Transactions on Computers

    4 publications · 119 citations

    4

    h-index

  4. Algorithmica

    4 publications · 82 citations

    4

    h-index

  5. Journal of the ACM

    JACM · 4 publications · 311 citations

    4

    h-index

1–5