Deterministic Sorting

Deterministic Sorting is a parallel sorting algorithm that belongs to the class of sorting methods characterized by producing identical output sequences for a given input across all executions, distinguished by its strict adherence to predetermined, non-probabilistic comparison and data movement rules that ensure reproducible ordering behavior regardless of execution environment or scheduling variations.

42

Publications

2.3K

Citations

66

Authors

43

Institutions

Publications per year

2017–2026

4

Authors

66

  1. JS
    Jeffrey Scott Vitter

    Duke University, United States

    7 publications · 313 citations

    7

    h-index

  2. YH
    Yijie Han

    University of Missouri–Kansas City, United States

    6 publications · 355 citations

    6

    h-index

  3. MH
    Mark H. Nodine

    Motorola (United States), United States

    4 publications · 185 citations

    4

    h-index

  4. TH
    Torben Hagerup

    Max Planck Society, Germany

    4 publications · 219 citations

    4

    h-index

  5. MT
    Mikkel Thorup

    AT&T (United States), United States

    4 publications · 207 citations

    4

    h-index

1–5 of 66

Venues

  1. Information and Computation

    3 publications · 202 citations

    3

    h-index

  2. Parallel Processing Letters

    3 publications · 57 citations

    3

    h-index

  3. Journal of the ACM

    JACM · 2 publications · 110 citations

    2

    h-index

  4. Geophysics

    1 publications · 22 citations

    1

    h-index

  5. SIAM Journal on Discrete Mathematics

    1 publications · 19 citations

    1

    h-index

1–5