Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Aggarwal A, Vitter JS (1988) The input/output complexity of sorting and related problems. Commun ACM 31:1116–1127
2. Andersson A, Nilsson S (1994) A new efficient radix sort. In: Proceedings of the 35th annual symposium on foundations of computer science (FOCS’94), Santa Fe. IEEE Computer Society Press, pp 714–721
3. Andersson A, Nilsson S (1998) Implementing radixsort. ACM J Exp Algorithmics 3:7
4. Arge L, Ferragina P, Grossi R, Vitter JS (1997) On sorting strings in external memory (extended abstract). In: Proceedings of the 29th annual ACM symposium on theory of computing (STOC’97), El Paso. ACM, pp 540–548
5. Bentley J, Sedgewick R (1998) Algorithm alley: sorting strings with three-way radix quicksort. Dr Dobb’s J Softw Tools 23:133–134, 136–138