1. A. Aggarwal, Optimal bounds for finding maximum on array of processors with k global buses, IEEE Trans. on Computers, C-35, 1986, 62–64.
2. S. G. Akl, The design and analysis of parallel algorithms, Prentice-Hall, Englewood Cliffs, New Jersey, 1989.
3. A. Bar-Noy and D. Peleg, Square meshes are not always optimal, IEEE Trans. on Computers, C-40, 1991, 196–204.
4. D. Bhagavathi, P. J. Looges, S. Olariu, J. L. Schwing, and J. Zhang, A fast selection algorithm on meshes with multiple broadcasting, Proc. International Conference on Parallel Processing, 1992, St-Charles, Illinois, III-10–17.
5. D. Bhagavathi, S. Olariu, W. Shen, and L. Wilson, A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications, Proc. Fourth Canadian Computational Geometry Conference, St-Johns, August 1992, 359–364.