Stable Parallel Sorting

Stable Parallel Sorting is a parallel sorting algorithm that preserves the relative order of equal elements across concurrent processing units, thereby ensuring both computational efficiency through parallelism and stability in the sorted output.

6

Publications

191

Citations

11

Authors

6

Institutions

Publications per year

2017–2026

1

Authors

11

  1. TH
    Torben Hagerup

    Max Planck Society, Germany

    2 publications · 94 citations

    2

    h-index

  2. SA
    Susanne Albers

    University of Freiburg, Germany

    2 publications · 94 citations

    2

    h-index

  3. JS
    Jeffrey S. Salowe

    University of Virginia, United States

    1 publications · 14 citations

    1

    h-index

  4. LW
    Lutz Wegner

    University of Kassel, Germany

    1 publications · 26 citations

    1

    h-index

  5. JI
    J. Ian Munro

    University of Waterloo, Canada

    1 publications · 14 citations

    1

    h-index

1–5 of 11

Venues

  1. BIT Numerical Mathematics

    1 publications · 14 citations

    1

    h-index

  2. IEEE Transactions on Computers

    1 publications · 26 citations

    1

    h-index

  3. ACM Journal of Experimental Algorithmics

    JEA · 1 publications · 37 citations

    1

    h-index

  4. IEEE Access

    1 publications · 20 citations

    1

    h-index

  5. Information and Computation

    1 publications · 69 citations

    1

    h-index

1–5