1. A super scalar sort algorithm for RISC processors;Agarwal;SIGMOD Record (ACM Special Interest Group on Management of Data),1996
2. Efficient sorting using registers and caches;Arge;Lecture Notes in Computer Science,2001
3. B.A. Sedgewick, Fast algorithms for sorting and searching strings, in: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1997. URL. citeseer.nj.nec.com/bentley97fast.html
4. C. Cérin, J.-L. Gaudiot, Evaluation of two bsp libraries through parallel sorting on clusters, in: Proceedings of WCBC’00 (The Second International Workshop on Cluster-Based Computing) in conjuction with ICS’00 (International Conference on Supercomputing, sponsored by ACM/SIGARCH), Santa Fe, New Mexico, 2000, pp. 21–26
5. C. Cérin, J.-L. Gaudiot, An over-partitioning scheme for parallel sorting on clusters running at different speeds, in: Cluster 2000. IEEE International Conference on Cluster Computing, Technische Universität Chemnitz, Saxony, Germany, 2000, Poster