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
Parents
118
Parallelism in Comparison Problems
Leslie G. Valiant · SIAM Journal on Computing · 1975 · 401 citations
Computing with Noisy Information
Uriel Feige, Prabhakar Raghavan, David Peleg et al. · SIAM Journal on Computing · 1994 · 314 citations
Expected time bounds for selection
Robert W. Floyd, Ronald L. Rivest · Communications of the ACM · 1975 · 280 citations · Full text
1–5 of 118
219
6
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 219
116

Johns Hopkins University
Baltimore, United States
5 h-index
7 publications
119 citations

University of Toronto
Toronto, Canada
3 h-index
3 publications
83 citations
University of Washington
Seattle, United States
3 h-index
3 publications
81 citations
New York University
New York, United States
3 h-index
6 publications
179 citations

University of Pisa
Pisa, Italy
3 h-index
4 publications
254 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
107 citations
Princeton University
Princeton, United States
3 h-index
5 publications
144 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
103 citations
1–8 of 116
25 publications · 1.9K citations
20
h-index
TALG · 5 publications · 184 citations
5
h-index
4 publications · 119 citations
4
h-index
4 publications · 82 citations
4
h-index
JACM · 4 publications · 311 citations
4
h-index
1–5