Deterministic Sorting
Deterministic Sorting is a parallel sorting algorithm that belongs to the class of sorting methods characterized by producing identical output sequences for a given input across all executions, distinguished by its strict adherence to predetermined, non-probabilistic comparison and data movement rules that ensure reproducible ordering behavior regardless of execution environment or scheduling variations.
42
Publications
2.3K
Citations
66
Authors
43
Institutions
Publications per year
2017–2026
4
Parents
42
Deterministic sorting in O(nloglogn) time and linear space
Yijie Han · Journal of Algorithms · 2003 · 162 citations
Improved deterministic parallel integer sorting
P.C.P. Bhatt, K. Diks, Torben Hagerup et al. · Information and Computation · 1991 · 108 citations
Faster deterministic sorting and searching in linear space
Arne Andersson · 2002 · 108 citations
1–5 of 42
66
7
h-index
6
h-index
4
h-index
4
h-index
4
h-index
1–5 of 66
43
University of Missouri–Kansas City
Kansas City, United States
6 h-index
6 publications
355 citations
Duke University
Durham, United States
4 h-index
8 publications
572 citations
AT&T (United States)
Bedminster, United States
3 h-index
3 publications
165 citations
New York University
New York, United States
3 h-index
4 publications
897 citations
Motorola (United States)
Schaumburg, United States
3 h-index
4 publications
278 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
6 publications
550 citations
University of Oxford
Oxford, United Kingdom
2 h-index
4 publications
140 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
3 publications
225 citations
1–8 of 43
3 publications · 202 citations
3
h-index
3 publications · 57 citations
3
h-index
JACM · 2 publications · 110 citations
2
h-index
1 publications · 22 citations
1
h-index
1 publications · 19 citations
1
h-index
1–5