Integer Sorting

Integer Sorting is a specialized sorting algorithm that belongs to the class of comparison-based or non-comparison-based sorting methods, distinguished by its restriction to and optimization for sorting integers within a bounded or structured domain, often leveraging properties such as fixed word size, radix representation, or integer hashing to achieve improved asymptotic performance over general-purpose sorting techniques.

79

Publications

3.2K

Citations

145

Authors

90

Institutions

Publications per year

2017–2026

12

Authors

145

  1. TH
    Torben Hagerup

    Max Planck Society, Germany

    7 publications · 355 citations

    7

    h-index

  2. YH
    Yijie Han

    University of Missouri–Kansas City, United States

    6 publications · 215 citations

    6

    h-index

  3. KD
    Keith D. Underwood

    Sandia National Laboratories, United States

    3 publications · 44 citations

    3

    h-index

  4. MT
    Mikkel Thorup

    AT&T (United States), United States

    3 publications · 165 citations

    3

    h-index

  5. RS
    Ron Sass

    University of North Carolina at Charlotte, United States

    3 publications · 44 citations

    3

    h-index

1–5 of 145

Venues

  1. Information and Computation

    4 publications · 251 citations

    4

    h-index

  2. Journal of the ACM

    JACM · 3 publications · 76 citations

    3

    h-index

  3. SIAM Journal on Computing

    3 publications · 231 citations

    3

    h-index

  4. ACM Journal of Experimental Algorithmics

    JEA · 2 publications · 41 citations

    2

    h-index

  5. IEEE Access

    2 publications · 26 citations

    2

    h-index

1–5