Parallel Sorting is a parallel algorithmic process that organizes data elements into a specified order by simultaneously executing multiple sorting operations across distributed or concurrent processing units.
939
Publications
49.9K
Citations
1.8K
Authors
625
Institutions
Publications per year
2017–2026
98
Publications
939
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations
Three Partition Refinement Algorithms
Robert Paige, Robert E. Tarjan · SIAM Journal on Computing · 1987 · 1.2K citations
C. A. R. Hoare · The Computer Journal · 1962 · 755 citations · Full text
1–5 of 939
Authors
1.8K
- JS
13
h-index
- GE
12
h-index
- UV
11
h-index
- SR
10
h-index
- TH
10
h-index
1–5 of 1.8K
Institutions
625
Carnegie Mellon University
Pittsburgh, United States
22 h-index
56 publications
3.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
16 h-index
29 publications
1.5K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
15 h-index
31 publications
1.4K citations
University of Maryland, College Park
College Park, United States
14 h-index
33 publications
1.9K citations
The University of Texas at Austin
Austin, United States
14 h-index
23 publications
810 citations
University of California, Berkeley
Berkeley, United States
13 h-index
35 publications
2.7K citations
IBM (United States)
Armonk, United States
13 h-index
30 publications
1.3K citations
Stanford University
Stanford, United States
13 h-index
17 publications
2.4K citations
1–8 of 625
Venues
- IEEE Transactions on Computers
40 publications · 4.2K citations
27
h-index
- SIAM Journal on Computing
21 publications · 4K citations
20
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 25 publications · 718 citations
19
h-index
- Communications of the ACM
19 publications · 3.1K citations
18
h-index
- Parallel Computing
17 publications · 653 citations
15
h-index
1–5