1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms, 1st edn. Addison-Wesley, Boston (1974)
2. Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proceedings of the 8th Annual Symposium on Discrete Algorithms, SODA 1997, New Orleans, LA, USA, January 1997, pp. 360–369 (1997)
3. Bhatt, P., Diks, K., Hagerup, T., Prasad, V., Radzik, T., Saxena, S.: Improved deterministic parallel integer sorting. Inf. Comput. 94(1), 29–47 (1991). https://doi.org/10.1016/0890-5401(91)90031-V
4. Bingmann, T., Eberle, A., Sanders, P.: Engineering parallel string sorting. Algorithmica 77(1), 235–286 (2015). https://doi.org/10.1007/s00453-015-0071-1
5. Bingmann, T., Sanders, P.: Parallel string sample sort. In: Proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, Sophia Antipolis, France, September 2013, pp. 169–180 (2013). https://doi.org/10.1007/978-3-642-40450-4_15