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
92
Faster algorithms for the shortest path problem
Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin et al. · Journal of the ACM · 1990 · 551 citations · Full text
Main-memory hash joins on multi-core CPUs: Tuning to the underlying hardware
Çagri Balkesen, Jens Teubner, Gustavo Alonso et al. · 2013 · 271 citations
Nadathur Satish, Changkyu Kim, Jatin Chhugani et al. · 2010 · 235 citations
1–5 of 92
232
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 232
113
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
13 publications
206 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
12 publications
1.8K citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
7 publications
405 citations

Saarland University
Saarbrücken, Germany
3 h-index
9 publications
743 citations

University of Waikato
Hamilton, New Zealand
3 h-index
6 publications
728 citations
Laboratoire de Mathématiques Blaise Pascal
Aubière, France
2 h-index
2 publications
52 citations
Columbia University
New York, United States
2 h-index
4 publications
214 citations

University of Waterloo
Waterloo, Canada
2 h-index
2 publications
330 citations
1–8 of 113
JEA · 4 publications · 149 citations
4
h-index
JACM · 3 publications · 600 citations
3
h-index
3 publications · 219 citations
3
h-index
2 publications · 37 citations
2
h-index
Repository · 2 publications · 76 citations
2
h-index
1–5