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
Parents
32
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 32
68
6
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 68
42
Max Planck Society
Munich, Germany
3 h-index
6 publications
286 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
3 h-index
5 publications
262 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
2 h-index
2 publications
48 citations
University of Maryland, College Park
College Park, United States
2 h-index
3 publications
147 citations

Mathematical Sciences Research Institute
Berkeley, United States
2 h-index
2 publications
48 citations

Saarland University
Saarbrücken, Germany
2 h-index
2 publications
130 citations

National Taipei University of Technology
Taipei, Taiwan
1 h-index
3 publications
54 citations
Louisiana State University
Baton Rouge, United States
1 h-index
3 publications
42 citations
1–8 of 42
4 publications · 252 citations
4
h-index
3 publications · 226 citations
3
h-index
1 publications · 97 citations
1
h-index
1 publications · 65 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5