Abstract
We describe new implementations of MSD radix sort for efficiently sorting large collections of strings. Our implementations are significantly faster than previous MSD radix sort implementations, and in fact faster than any other string sorting algorithm on several data sets. We also describe a new variant that achieves high space-efficiency at a small additional cost on runtime. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Kärkkäinen, J., & Rantala, T. (2008). Engineering radix sort for strings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5280 LNCS, pp. 3–14). Springer Verlag. https://doi.org/10.1007/978-3-540-89097-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
