Complexity of Sorting is the computational complexity associated with determining the minimum number of comparison or time operations required by an optimal sorting algorithm to arrange a list of elements in a prescribed order under a given model of computation.
182
Publications
9.5K
Citations
283
Authors
163
Institutions
Publications per year
2017–2026
18
Parents
Publications
182
The input/output complexity of sorting and related problems
Alok Aggarwal · Communications of the ACM · 1988 · 1.2K citations · Full text
Miklós Ajtai, János Komlós, Endre Szemerédi · 1983 · 671 citations
Parallelism in Comparison Problems
Leslie G. Valiant · SIAM Journal on Computing · 1975 · 401 citations
Two algorithms for maintaining order in a list
Paul F. Dietz, Daniel D. Sleator · 1987 · 324 citations · Full text
1–5 of 182
Authors
283
- YH
5
h-index
- AB
5
h-index
- YA
4
h-index
- MT
4
h-index
- LG
3
h-index
1–5 of 283
Institutions
163
University of Washington
Seattle, United States
6 h-index
8 publications
319 citations
University of Pisa
Pisa, Italy
6 h-index
7 publications
380 citations
IBM (United States)
Armonk, United States
5 h-index
5 publications
1.4K citations
University of Missouri–Kansas City
Kansas City, United States
5 h-index
5 publications
261 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
5 publications
358 citations
University of British Columbia
Vancouver, Canada
4 h-index
4 publications
109 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
4 h-index
4 publications
106 citations
University of Toronto
Toronto, Canada
4 h-index
5 publications
174 citations
1–8 of 163
Venues
- SIAM Journal on Computing
15 publications · 1.5K citations
15
h-index
- IEEE Transactions on Computers
13 publications · 859 citations
11
h-index
- SIAM Journal on Discrete Mathematics
5 publications · 113 citations
5
h-index
- Journal of the ACM
JACM · 5 publications · 493 citations
5
h-index
- Communications of the ACM
5 publications · 1.4K citations
5
h-index
1–5