Parallel Sort Algorithms

Parallel Sort Algorithms is a computational method that belongs to the class of sorting algorithms and is distinguished by its ability to exploit concurrent processing across multiple processors or nodes to efficiently sort large datasets in parallel database systems.

352

Publications

19.5K

Citations

671

Authors

273

Institutions

Publications per year

2017–2026

26

Authors

671

  1. JS
    Jeffrey Scott Vitter

    Duke University, United States

    10 publications · 403 citations

    10

    h-index

  2. TH
    Torben Hagerup

    Max Planck Society, Germany

    8 publications · 284 citations

    8

    h-index

  3. MT
    Michael T. Goodrich

    Johns Hopkins University, United States

    6 publications · 265 citations

    6

    h-index

  4. PS
    Peter Sanders

    Karlsruhe Institute of Technology, Germany

    6 publications · 166 citations

    6

    h-index

  5. SG
    Selim G. Akl

    Queen's University, Canada

    5 publications · 169 citations

    5

    h-index

1–5 of 671

Venues

  1. IEEE Transactions on Computers

    24 publications · 1.9K citations

    20

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 13 publications · 394 citations

    13

    h-index

  3. SIAM Journal on Computing

    9 publications · 1.6K citations

    9

    h-index

  4. Information Processing Letters

    7 publications · 172 citations

    7

    h-index

  5. Communications of the ACM

    7 publications · 954 citations

    7

    h-index

1–5