Sorting Networks
A Sorting Network is a fixed, comparison-based algorithmic structure composed of a sequence of comparators arranged in a predetermined parallel configuration that sorts arbitrary input sequences by systematically swapping elements to achieve ascending order.
175
Publications
7.7K
Citations
322
Authors
177
Institutions
Publications per year
2017–2026
24
175
Topological sorting of large networks
Arthur B. Kahn · Communications of the ACM · 1962 · 738 citations · Full text
Miklós Ajtai, János Komlós, Endre Szemerédi · 1983 · 671 citations
A logarithmic time sort for linear size networks
John H. Reif, Leslie G. Valiant · Journal of the ACM · 1987 · 215 citations · Full text
1–5 of 175
322
6
h-index
5
h-index
4
h-index
University of Illinois Urbana-Champaign, United States
3 publications · 232 citations
3
h-index
3
h-index
1–5 of 322
177
Stanford University
Stanford, United States
7 h-index
15 publications
608 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
5 publications
735 citations
The University of Texas at Austin
Austin, United States
5 h-index
7 publications
112 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
10 publications
528 citations
Seoul National University
Seoul, South Korea
4 h-index
8 publications
146 citations

Pennsylvania State University
State College, United States
4 h-index
5 publications
102 citations
University of Southern California
Los Angeles, United States
4 h-index
11 publications
425 citations
Kent State University
Kent, United States
4 h-index
6 publications
171 citations
1–8 of 177
18 publications · 1K citations
13
h-index
JACM · 7 publications · 877 citations
7
h-index
5 publications · 121 citations
5
h-index
TPDS · 5 publications · 193 citations
5
h-index
3 publications · 143 citations
3
h-index
1–5