Parallel Comparison Sorting is a parallel sorting algorithm that belongs to the class of comparison-based sorting methods, distinguished by its concurrent execution of pairwise element comparisons across multiple processing units to reduce overall sorting time.
9
Publications
334
Citations
19
Authors
12
Institutions
Publications per year
2017–2026
3
Parents
Publications
9
Communication-Efficient Parallel Sorting
Michael T. Goodrich · SIAM Journal on Computing · 1999 · 132 citations
Parallelism in Randomized Incremental Algorithms
Guy E. Blelloch, Yan Gu, Julian Shun et al. · 2016 · 43 citations · Full text
Tight complexity bounds for parallel comparison sorting
Noga Alon, Yossi Azar, Uzi Vishkin · 1986 · 24 citations
1–5 of 9
Authors
19
- GE
2
h-index
- YG
2
h-index
- JS
2
h-index
- NA
2
h-index
- YS
2
h-index
1–5 of 19
Institutions
12
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
146 citations
Tel Aviv University
Tel Aviv, Israel
2 h-index
5 publications
142 citations
University of Chinese Academy of Sciences
Beijing, China
1 h-index
1 publications
22 citations
International Institute of Information Technology, Hyderabad
Hyderabad, India
1 h-index
3 publications
33 citations
University of California, Riverside
Riverside, United States
1 h-index
2 publications
34 citations
IIT@MIT
Cambridge, United States
1 h-index
1 publications
17 citations
Core Competence
Santa Fe, United States
1 h-index
1 publications
24 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
43 citations
1–8 of 12
Venues
- SIAM Journal on Computing
2 publications · 167 citations
2
h-index
- Journal of the ACM
JACM · 1 publications · 17 citations
1
h-index
- IEEE Communications Letters
1 publications · 22 citations
1
h-index
- IEEE Transactions on Industrial Electronics
1 publications · 37 citations
1
h-index
1–4