Radix Sort

Radix Sort is a non-comparative integer sorting algorithm that processes individual digits of numbers, starting from the least significant digit to the most significant (or vice versa), and uses a stable sub-sorting algorithm—typically counting sort or bucket sort—to arrange elements based on each digit, thereby achieving linear time complexity under specific conditions.

92

Publications

5.1K

Citations

232

Authors

113

Institutions

Publications per year

2017–2026

13

Authors

232

  1. RM
    Rory Mitchell

    University of Waikato, New Zealand

    3 publications · 364 citations

    3

    h-index

  2. JL
    Josep-L. Larriba-Pey

    Universitat Politècnica de Catalunya, Spain

    3 publications · 54 citations

    3

    h-index

  3. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    3 publications · 189 citations

    3

    h-index

  4. EF
    Eibe Frank

    University of Waikato, New Zealand

    3 publications · 364 citations

    3

    h-index

  5. JJ
    Juan J. Navarro

    Universitat Politècnica de Catalunya, Spain

    3 publications · 54 citations

    3

    h-index

1–5 of 232

Venues

  1. ACM Journal of Experimental Algorithmics

    JEA · 4 publications · 149 citations

    4

    h-index

  2. Journal of the ACM

    JACM · 3 publications · 600 citations

    3

    h-index

  3. IEEE Transactions on Computers

    3 publications · 219 citations

    3

    h-index

  4. The Computer Journal

    2 publications · 37 citations

    2

    h-index

  5. arXiv (Cornell University)

    Repository · 2 publications · 76 citations

    2

    h-index

1–5