1. A. Aggarwal and J. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31:1116–1127, 1988.
2. A. Alexandrov, M. Ionescu, K. Schauser, and C. Scheiman. LogGP: iNcorporating long messages into the LogP model — one step closer towards a realistic model for parallel computation. In Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA’95), pages 95–105, 1995.
3. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Cros, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostouchov, and D. Sorensen. LAPACK Users’ Guide. SIAM, Philadelphia, PA, 2nd edition, 1995.
4. D. A. Bader. An improved randomized selection algorithm with an experimental study. In Proceedings of the 2nd Workshop on Algorithm Engineering and Experiments (ALENEX’00), pages 115–129, 2000. http://www.cs.unm.edu/Conferences/ALENEX00/ .
5. D. A. Bader, D. R. Helman, and J. JáJá. Practical parallel algorithms for personalized communication and integer sorting. ACM Journal of Experimental Algorithmics, 1(3):1–42, 1996. http://www.jea.acm.org/1996/BaderPersonalized/ .