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

Authors

170

  1. VK
    Viktor K. Prasanna

    University of Southern California, United States

    3 publications · 80 citations

    3

    h-index

  2. ES
    Endre Szemerédi

    Hungarian Academy of Sciences, Hungary

    3 publications · 1.3K citations

    3

    h-index

  3. VP
    Vincent Pilaud

    Laboratoire d'Informatique de l'École Polytechnique, France

    3 publications · 126 citations

    3

    h-index

  4. JK
    János Komlós

    Hungarian Academy of Sciences, Hungary

    3 publications · 1.3K citations

    3

    h-index

  5. MA
    Miklós Ajtai

    IBM Research - Almaden, United States

    3 publications · 1.3K citations

    3

    h-index

1–5 of 170

Venues

  1. IEEE Transactions on Computers

    7 publications · 1.5K citations

    7

    h-index

  2. Journal of Parallel and Distributed Computing

    4 publications · 135 citations

    4

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 93 citations

    3

    h-index

  4. SIAM Journal on Computing

    3 publications · 79 citations

    3

    h-index

  5. Algorithmica

    2 publications · 157 citations

    2

    h-index

1–5