Parallel Sorting Algorithms
Parallel Sorting Algorithms is a class of sorting algorithms that belong to the broader category of divide-and-conquer algorithms, distinguished by their explicit design to distribute the sorting process across multiple processors or cores to achieve concurrent comparison and data movement, thereby reducing overall execution time in parallel computation environments.
415
Publications
20.3K
Citations
776
Authors
299
Institutions
Publications per year
2017–2026
32
415
Richard Cole · SIAM Journal on Computing · 1988 · 734 citations
Sorting inc logn parallel steps
Miklós Ajtai, János Komlós, Endre Szemerédi · COMBINATORICA · 1983 · 513 citations
Sorting on a mesh-connected parallel computer
Clark D. Thompson, H. T. Kung · Communications of the ACM · 1977 · 476 citations · Full text
1–5 of 415
776
11
h-index
7
h-index
7
h-index
6
h-index
6
h-index
1–5 of 776
299
Carnegie Mellon University
Pittsburgh, United States
13 h-index
26 publications
2.3K citations
University of California, Berkeley
Berkeley, United States
11 h-index
29 publications
2.1K citations
Duke University
Durham, United States
9 h-index
16 publications
812 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
8 h-index
16 publications
822 citations
University of Illinois Urbana-Champaign
Urbana, United States
8 h-index
14 publications
866 citations
IBM (United States)
Armonk, United States
7 h-index
12 publications
532 citations

Cornell University
Ithaca, United States
7 h-index
10 publications
908 citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
11 publications
739 citations
1–8 of 299
22 publications · 1.9K citations
20
h-index
13 publications · 2.2K citations
13
h-index
TPDS · 13 publications · 393 citations
13
h-index
9 publications · 361 citations
9
h-index
8 publications · 201 citations
8
h-index
1–5