Three partition refinement algorithms
SIAM Journal on Computing
Text compression
Introduction to algorithms
Software—Practice & Experience
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Algorithms and Data Structures: Design, Correctness, Analysis
Algorithms and Data Structures: Design, Correctness, Analysis
Lecture Notes on Bucket Algorithms
Lecture Notes on Bucket Algorithms
Cache-conscious sorting of large sets of strings with dynamic tries
Journal of Experimental Algorithmics (JEA)
MWE '03 Proceedings of the ACL 2003 workshop on Multiword expressions: analysis, acquisition and treatment - Volume 18
Implementing sorting in database systems
ACM Computing Surveys (CSUR)
Fast string sorting using order-preserving compression
Journal of Experimental Algorithmics (JEA)
Using random sampling to build approximate tries for efficient string sorting
Journal of Experimental Algorithmics (JEA)
Cache-efficient string sorting using copying
Journal of Experimental Algorithmics (JEA)
An efficient, versatile approach to suffix sorting
Journal of Experimental Algorithmics (JEA)
Generic discrimination: sorting and paritioning unshared data in linear time
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Efficient Adaptive In-Place Radix Sorting
Informatica
Engineering Radix Sort for Strings
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Engineering burstsort: Toward fast in-place string sorting
Journal of Experimental Algorithmics (JEA)
Engineering burstsort: towards fast in-place string sorting
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
Algorithms and theory of computation handbook
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
We present and evaluate several optimization and implementation techniques for string sorting. In particular, we study a recently published radix sorting algorithm, Forward radixsort, that has a provably good worst-case behavior. Our experimental results indicate that radix sorting is considerably faster (often more than twice as fast) than comparison-based sorting methods. This is true even for small input sequences. We also show that it is possible to implement a radixsort with good worst-case running time without sacrificing average-case performance. Our implementations are competitive with the best previously published string sorting programs.