1. K. E. Batcher, Design of a Massively Parallel Processor,IEEE Trans. Comput.,29 (1980), 836–840.
2. Y. Han, Y. Igarashi, and M. Truszczynski, Indexing Schemes and Lower Bounds for Sorting on a Mesh-Connected Computer, Technical Report TR-114-88, Department of Computer Science, University of Kentucky, Lexington.
3. V. F. Kolchin, Random Mappings, Optimization Software, New York, 1986.
4. D. Krizanc, Oblivious Routing with Limited Buffer Capacity, Technical Report TR-14-87, Aiken Computation Laboratory, Harvard University, Cambridge, Mass.
5. D. Krizanc, S. Rajasekaran, and Th. Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays In:VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing (AWOC '88), Lecture Notes in Computer Science, Vol. 319, pp. 411–422, Springer-Verlag, New York, 1988.