Parallel Integer Sorting

Parallel Integer Sorting is a parallel sorting algorithm designed specifically for sorting integer keys, distinguished by its exploitation of the discrete and ordered nature of integers to achieve efficient distribution and comparison operations across multiple processing units.

32

Publications

1.2K

Citations

68

Authors

42

Institutions

Publications per year

2017–2026

1

Authors

68

  1. TH
    Torben Hagerup

    Max Planck Society, Germany

    6 publications · 299 citations

    6

    h-index

  2. JH
    John H. Reif

    Duke University, United States

    2 publications · 298 citations

    2

    h-index

  3. UV
    Uzi Vishkin

    University of Maryland, College Park, United States

    2 publications · 82 citations

    2

    h-index

  4. SR
    Sanguthevar Rajasekaran

    University of Connecticut, United States

    2 publications · 202 citations

    2

    h-index

  5. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    2 publications · 48 citations

    2

    h-index

1–5 of 68

Venues

  1. SIAM Journal on Computing

    4 publications · 252 citations

    4

    h-index

  2. Information and Computation

    3 publications · 226 citations

    3

    h-index

  3. Communications of the ACM

    1 publications · 97 citations

    1

    h-index

  4. Journal of Algorithms

    1 publications · 65 citations

    1

    h-index

  5. 1

    h-index

1–5