Prefix-based Sorting
Prefix-Based Sorting is a parallel sorting algorithm that organizes elements by distributing them across processors based on the prefix of their keys, where the distribution and comparison logic are determined by the lexicographic ordering of key prefixes to enable efficient, scalable sorting in distributed memory systems.
26
Publications
1.5K
Citations
44
Authors
31
Institutions
Publications per year
2017–2026
0
Parents
26
Bounds for sorting by prefix reversal
William H. Gates, Christos H. Papadimitriou · Discrete Mathematics · 1979 · 298 citations
Fast BWT in small space by blockwise suffix sorting
Juha Kärkkäinen · Theoretical Computer Science · 2007 · 93 citations
1–5 of 26
44
3
h-index
3
h-index
JSS Academy of Higher Education and Research, India
3 publications · 548 citations
3
h-index
2
h-index
2
h-index
1–5 of 44
31

Washington University in St. Louis
St Louis, United States
4 h-index
10 publications
1.7K citations

University of Aizu
Fukushima, Japan
2 h-index
2 publications
37 citations
University of Florida
Gainesville, United States
2 h-index
3 publications
184 citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
2 h-index
4 publications
62 citations

SUNY Geneseo
Geneseo, United States
1 h-index
1 publications
52 citations

University of Southern Denmark
Odense, Denmark
1 h-index
1 publications
19 citations
West Virginia University
Morgantown, United States
1 h-index
2 publications
36 citations
Microsoft (United States)
Redmond, United States
1 h-index
1 publications
298 citations
1–8 of 31
3 publications · 48 citations
3
h-index
2 publications · 110 citations
2
h-index
TPDS · 2 publications · 136 citations
2
h-index
1 publications · 13 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5