1. A. Aggarwal, Optimal bounds for finding maximum on array of processots with k global buses, IEEE Transactions on Computers, C-35 (1986) 62–64.
2. A. Aggarwal and R. C. Melville, Fast computation of the modality of polygons, Journal of Algorithms, 7 (1986) 369–381.
3. G. S. Almasi and A. Gottlieb, Highly parallel computing, Second Edition, Benjamin/Cummings, Redwood City, California, 1994.
4. D. H. Ballard and C. M. Brown, Computer Vision, Prentice-Hall, Englewood Cliffs, New Jersey, 1982.
5. 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.