Parallel String Sorting is a parallel algorithmic method that organizes sequences of characters into lexicographical order by exploiting concurrent computational processes to accelerate sorting operations on large-scale string datasets.
14
Publications
421
Citations
40
Authors
20
Institutions
Publications per year
2017–2026
2
Parents
Publications
14
Efficient parallel merge sort for fixed and variable length keys
Andrew Davidson, David Tarjan, Michael Garland et al. · 2012 · 62 citations · Full text
Minsik Cho, Daniël Brand, Rajesh Bordawekar et al. · Proceedings of the VLDB Endowment · 2015 · 45 citations
Parallel suffix array and least common prefix for the GPU
Mrinal Deo, S. Keely · 2013 · 41 citations
1–5 of 14
Authors
40
- MD
2
h-index
- SK
2
h-index
- DD
1
h-index
- AD
1
h-index
- DJ
1
h-index
1–5 of 40
Institutions
20
Advanced Micro Devices (United States)
Sunnyvale, United States
2 h-index
4 publications
138 citations
Tel Aviv University
Tel Aviv, Israel
1 h-index
1 publications
11 citations
Education University of Hong Kong
Tai Po, Hong Kong
1 h-index
1 publications
20 citations
Universidade Federal de Pernambuco
Recife, Brazil
1 h-index
2 publications
84 citations
University of California System
Oakland, United States
1 h-index
2 publications
124 citations
National Institute of Astrophysics, Optics and Electronics
Puebla City, Mexico
1 h-index
3 publications
150 citations
Kyungpook National University
Daegu, South Korea
1 h-index
1 publications
11 citations
Nvidia (United Kingdom)
Reading, United Kingdom
1 h-index
2 publications
124 citations
1–8 of 20
Venues
- Theoretical Computer Science
1 publications · 11 citations
1
h-index
- Knowledge and Information Systems
1 publications · 22 citations
1
h-index
- Algorithmica
1 publications · 27 citations
1
h-index
- ACM SIGPLAN Notices
1 publications · 28 citations
1
h-index
- PLoS ONE
1 publications · 21 citations
1
h-index
1–5