Parallel Sorting Networks
Parallel Sorting Networks is a parallel data structure that consists of a fixed arrangement of comparators organized in stages to sort input sequences through concurrent pairwise comparisons, distinguished from sequential sorting algorithms by its predetermined, input-independent sequence of operations enabling efficient hardware implementation and analysis within parallel complexity theory.
83
Publications
8.2K
Citations
170
Authors
96
Institutions
Publications per year
2017–2026
9
83
Sorting networks and their applications
Kenneth E. Batcher · 1968 · 2.4K citations
Miklós Ajtai, János Komlós, Endre Szemerédi · 1983 · 671 citations
Universal schemes for parallel communication
Leslie G. Valiant, Gordon Brebner · 1981 · 631 citations
Sorting inc logn parallel steps
Miklós Ajtai, János Komlós, Endre Szemerédi · COMBINATORICA · 1983 · 513 citations
1–5 of 83
170
3
h-index
3
h-index
Laboratoire d'Informatique de l'École Polytechnique, France
3 publications · 126 citations
3
h-index
3
h-index
3
h-index
1–5 of 170
96
University of California, Berkeley
Berkeley, United States
4 h-index
7 publications
171 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
6 publications
1.3K citations
University of Southern California
Los Angeles, United States
3 h-index
8 publications
206 citations
Stanford University
Stanford, United States
3 h-index
5 publications
119 citations

University of Rochester
Rochester, United States
2 h-index
2 publications
69 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
4 publications
117 citations

Hungarian Academy of Sciences
Budapest, Hungary
2 h-index
4 publications
1.6K citations
Laboratoire d'Informatique de l'École Polytechnique
Palaiseau, France
2 h-index
2 publications
71 citations
1–8 of 96
7 publications · 1.5K citations
7
h-index
4 publications · 135 citations
4
h-index
TPDS · 3 publications · 93 citations
3
h-index
3 publications · 79 citations
3
h-index
2 publications · 157 citations
2
h-index
1–5