1. S. Akers, D. Harel, and B. Krishnamurthy, “The Star Graph: An Attractive Alternative to the n-Cube,” Proc. International Conference of Parallel Processing, 1987, pp. 393–400.
2. R. Aleliunas, “Randomized parallel communication,” Proc. Symposium on Principles of Distributed Computing, 1982, pp. 60–72.
3. M. Blum, R. Floyd, V.R. Pratt, R. Rivest, and R. Tarjan, “Time Bounds for Selection,” Journal of Computer and System Science, vol. 7, no. 4, 1972, pp. 448–461.
4. A. Borodin and J. E. Hopcroft, “Routing, merging and sorting on parallel models of computation,” Proc. Symposium on Theory of Computing, 1982, pp. 338–344.
5. R.W. Floyd and R.L. Rivest, “Expected Time Bounds for Selection,” Comm. of the ACM, vol. 18, no. 3, March 1975, pp. 165–172.