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
Parents
79
The Art of Computer Programming, Volume 3, Sorting and Searching
Matthew Wilkes · The Computer Journal · 1974 · 716 citations · Full text
An optimal parallel algorithm for integer sorting
John H. Reif · 1985 · 124 citations
Improved deterministic parallel integer sorting
P.C.P. Bhatt, K. Diks, Torben Hagerup et al. · Information and Computation · 1991 · 108 citations
Fast parallel sorting algorithms
D. S. Hirschberg · Communications of the ACM · 1978 · 97 citations · Full text
1–5 of 79
145
7
h-index
6
h-index
3
h-index
3
h-index
3
h-index
1–5 of 145
90
University of Missouri–Kansas City
Kansas City, United States
5 h-index
5 publications
193 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
4 h-index
7 publications
374 citations
AT&T (United States)
Bedminster, United States
4 h-index
4 publications
175 citations
Max Planck Society
Munich, Germany
4 h-index
8 publications
398 citations
University of Maryland, College Park
College Park, United States
4 h-index
6 publications
220 citations
Clemson University
Clemson, United States
3 h-index
9 publications
132 citations
Queen's University
Kingston, Canada
2 h-index
4 publications
86 citations
King's College London
London, United Kingdom
2 h-index
3 publications
64 citations
1–8 of 90
4 publications · 251 citations
4
h-index
JACM · 3 publications · 76 citations
3
h-index
3 publications · 231 citations
3
h-index
JEA · 2 publications · 41 citations
2
h-index
2 publications · 26 citations
2
h-index
1–5