Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
string sorting
Description:
The computational task of ordering strings according to a specified lexicographic or other comparison rule.
Primary topic:
Algorithms and Data Compression (66%)
Related topics:
Algorithms and Data Compression (66%),
Parallel Computing and Optimization Techniques (10%)
OpenAlex ID:
keywords/string-sorting
Fast algorithms for sorting and searching strings
1997
·
Jon Bentley
, Robert Sedgewick
·
Symposium on Discrete Algorithms
·
400
Cluster Sorting with Mixed Character Types, II - Fusion Strategies.
1970
·
E. J. Burr
·
Australian Computer Journal
·
91
On sorting strings in external memory (extended abstract)
1997
·
Lars Arge
, Paolo Ferragina
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
87
Engineering radix sort
1993
·
Peter M. McIlroy
, Keith Bostic
, et al.
·
Computing systems
·
85
Partition Refinement Techniques: an Interesting Algorithmic Tool Kit
1999
·
MICHEL HABIB
, CHRISTOPHE PAUL
, et al.
·
International Journal of Foundations of Computer Science
·
79
Efficient parallel merge sort for fixed and variable length keys
2012
·
Andrew Davidson
, David Tarjan
, et al.
·
Innovative Parallel Computing (InPar)
·
69
PDF
A Bijective String Sorting Transform
2012
·
Gil, Joseph Yossi
, Scott, David Allen
·
arXiv (Cornell University)
·
54
PDF
Cache-conscious sorting of large sets of strings with dynamic tries
2004
·
Ranjan Sinha
, Justin Zobel
·
ACM Journal of Experimental Algorithmics
·
52
Cache-efficient string sorting using copying
2007
·
Ranjan Sinha
, Justin Zobel
, et al.
·
ACM Journal of Experimental Algorithmics
·
47
Implementing radixsort
1998
·
Arne Andersson
, Stefan Nilsson
·
ACM Journal of Experimental Algorithmics
·
40
The use of generalized information dimension in measuring fractal dimension of time series
1999
·
Y. Ashkenazy
·
Physica A Statistical Mechanics and its Applications
·
32
PDF
Engineering Radix Sort for Strings
2008
·
Juha Kärkkäinen
, Tommi Rantala
·
Lecture notes in computer science
·
30
Using random sampling to build approximate tries for efficient string sorting
2005
·
Ranjan Sinha
, Justin Zobel
·
ACM Journal of Experimental Algorithmics
·
30
Experimental and Efficient Algorithms
2004
·
Sinha, Ranjan
, Zobel, Justin
·
Lecture notes in computer science
·
28
Can GPUs sort strings efficiently?
2013
·
Aditya Deshpande
, P J Narayanan
·
IEEE International Conference on High Performance Computing, Data, and Analytics
·
24
A bijective variant of the Burrows–Wheeler Transform using V -order
2014
·
Jacqueline W. Daykin
, W.F. Smyth
·
Theoretical Computer Science
·
22
PDF
Prefix Reversals on Binary and Ternary Strings
2007
·
Cor Hurkens
, Leo van Iersel
, et al.
·
Lecture notes in computer science
·
22
Parallel String Sample Sort
2013
·
Timo Bingmann
, Peter Sanders
·
Lecture notes in computer science
·
20
PDF
Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems
2019
·
Kamil Khadiev
, Artem Ilikaev
·
Lecture notes in computer science
·
19
PDF
Optimal parallel string algorithms: sorting, merging and computing the minimum
1994
·
Torben Hagerup
·
ACM Symposium on Theory of Computing (STOC)
·
18
Lower bounds for processing data with few random accesses to external memory
2009
·
Martin Grohe
, André Hernich
, et al.
·
Journal of the ACM
·
17
Radix Sorting & Searching
1996
·
Stefan Nilsson
·
Lund University Publications (Lund University)
·
16
The complexity of matrix transposition on one-tape off-line Turing machines
1991
·
Martin Dietzfelbinger
, Wolfgang Maass
, et al.
·
Theoretical Computer Science
·
15
String distribution for the polyphase sort
1963
·
W. David Malcolm
·
Communications of the ACM
·
15
PDF
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
2018
·
Bingmann, Timo
·
Repository KITopen (Karlsruhe Institute of Technology)
·
14
Show more works
View as search
Works count:
170
Citation count:
1,602
Year
Topic
Type