Parallel Sorting Algorithms

Parallel Sorting Algorithms is a class of sorting algorithms that belong to the broader category of divide-and-conquer algorithms, distinguished by their explicit design to distribute the sorting process across multiple processors or cores to achieve concurrent comparison and data movement, thereby reducing overall execution time in parallel computation environments.

415

Publications

20.3K

Citations

776

Authors

299

Institutions

Publications per year

2017–2026

32

Authors

776

  1. JS
    Jeffrey Scott Vitter

    Duke University, United States

    11 publications · 432 citations

    11

    h-index

  2. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    7 publications · 397 citations

    7

    h-index

  3. TH
    Torben Hagerup

    Max Planck Society, Germany

    7 publications · 268 citations

    7

    h-index

  4. PS
    Peter Sanders

    Karlsruhe Institute of Technology, Germany

    6 publications · 269 citations

    6

    h-index

  5. SR
    Sanguthevar Rajasekaran

    University of Connecticut, United States

    6 publications · 287 citations

    6

    h-index

1–5 of 776

Venues

  1. IEEE Transactions on Computers

    22 publications · 1.9K citations

    20

    h-index

  2. SIAM Journal on Computing

    13 publications · 2.2K citations

    13

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 13 publications · 393 citations

    13

    h-index

  4. Parallel Computing

    9 publications · 361 citations

    9

    h-index

  5. Information Processing Letters

    8 publications · 201 citations

    8

    h-index

1–5