Stable Parallel Sorting
Stable Parallel Sorting is a parallel sorting algorithm that preserves the relative order of equal elements across concurrent processing units, thereby ensuring both computational efficiency through parallelism and stability in the sorted output.
6
Publications
191
Citations
11
Authors
6
Institutions
Publications per year
2017–2026
1
Parents
6
Lutz Wegner · IEEE Transactions on Computers · 1985 · 26 citations
Improved parallel integer sorting without concurrent writing
Susanne Albers, Torben Hagerup · 1992 · 25 citations · Full text
1–5 of 6
11
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 11
6
Max Planck Society
Munich, Germany
2 h-index
4 publications
188 citations

University of Waterloo
Waterloo, Canada
1 h-index
2 publications
28 citations
University of New Mexico
Albuquerque, United States
1 h-index
2 publications
40 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
2 publications
138 citations
Karlsruhe University of Education
Karlsruhe, Germany
1 h-index
1 publications
26 citations
University of Virginia
Charlottesville, United States
1 h-index
1 publications
14 citations
Museum of London
London, United Kingdom
1 publications
15 citations
UK Research and Innovation
Swindon, United Kingdom
1 publications
15 citations
1–8 of 6
1 publications · 14 citations
1
h-index
1 publications · 26 citations
1
h-index
JEA · 1 publications · 37 citations
1
h-index
1 publications · 20 citations
1
h-index
1 publications · 69 citations
1
h-index
1–5