String Sorting is a sorting algorithm that specializes in ordering sequences of characters lexicographically by comparing and arranging strings based on their constituent characters in a predefined order.
79
Publications
3.6K
Citations
141
Authors
97
Institutions
Publications per year
2017–2026
3
Parents
Publications
79
Optimal suffix tree construction with large alphabets
2002 · 452 citations
Fast algorithms for sorting and searching strings
Jon Bentley, Robert Sedgewick · 1997 · 399 citations
Linear Suffix Array Construction by Almost Pure Induced-Sorting
Ge Nong, Sen Zhang, Wai Hong Chan · 2009 · 147 citations
1–5 of 79
Authors
141
- AA
4
h-index
- SJ
4
h-index
- GN
4
h-index
- CK
2
h-index
- JH
2
h-index
1–5 of 141
Institutions
97
Sun Yat-sen University
Guangzhou, China
4 h-index
4 publications
394 citations
Lund University
Lund, Sweden
3 h-index
5 publications
160 citations
RMIT University
Melbourne, Australia
3 h-index
6 publications
192 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
3 h-index
5 publications
112 citations
Princeton University
Princeton, United States
2 h-index
2 publications
421 citations
Wilfrid Laurier University
Waterloo, Canada
2 h-index
2 publications
26 citations
Honeywell (United States)
Charlotte, United States
2 h-index
2 publications
32 citations
The University of Western Australia
Perth, Australia
2 h-index
2 publications
38 citations
1–8 of 97
Venues
- Communications of the ACM
5 publications · 86 citations
5
h-index
- ACM Journal of Experimental Algorithmics
JEA · 4 publications · 145 citations
4
h-index
- IEEE Transactions on Computers
3 publications · 217 citations
3
h-index
- The Computer Journal
3 publications · 65 citations
3
h-index
- Algorithmica
3 publications · 109 citations
3
h-index
1–5