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

Authors

322

  1. KE
    Kenneth E. Batcher

    Kent State University, United States

    6 publications · 185 citations

    6

    h-index

  2. GB
    Gianfranco Bilardi

    University of Padua, Italy

    5 publications · 131 citations

    5

    h-index

  3. IP
    Ian Parberry

    University of North Texas, United States

    4 publications · 127 citations

    4

    h-index

  4. FP
    Franco P. Preparata

    University of Illinois Urbana-Champaign, United States

    3 publications · 232 citations

    3

    h-index

  5. LR
    Larry Rudolph

    Massachusetts Institute of Technology, United States

    3 publications · 193 citations

    3

    h-index

1–5 of 322

Venues

  1. IEEE Transactions on Computers

    18 publications · 1K citations

    13

    h-index

  2. Journal of the ACM

    JACM · 7 publications · 877 citations

    7

    h-index

  3. SIAM Journal on Computing

    5 publications · 121 citations

    5

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 5 publications · 193 citations

    5

    h-index

  5. 3

    h-index

1–5