Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	F. Annexstein , M. Baumslag, A unified approach to off-line permutation routing on parallel networks, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.398-406, July 02-06, 1990, Island of Crete, Greece  [doi>10.1145/97444.97707]
	2	D. Krizanc. A note on offiine routing on meshconnected processor arrays. Parallel Processing Letters, 1:65-69, 1991.
	3	M. Kunde, Routing and sorting on mesh-connected arrays (extended abstract), VLSI Algorithms and Architectures, Springer-Verlag, London, 1988
	4	Manfred Kunde, Balanced routing: towards the distance bound on grids, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.260-271, July 21-24, 1991, Hilton Head, South Carolina, United States  [doi>10.1145/113379.113403]
	5	F. T. Leighton, Average case analysis of greedy routing algorithms on arrays, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.2-10, July 02-06, 1990, Island of Crete, Greece  [doi>10.1145/97444.97448]
	6	T. Leighton , F. Makedon , I. G. Tollis, A 2n-2 step algorithm for routing in an nxn array with constant size queues, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.328-335, June 18-21, 1989, Santa Fe, New Mexico, United States  [doi>10.1145/72935.72970]
	7	Sanguthevar Rajasekaran , Richard Overholt, Constant queue routing on a mesh, Proceedings of the 8th annual symposium on Theoretical aspects of computer science, p.444-455, February 1991, Hamburg, Germany
	8	Danny Krizanc , Sanguthevar Rajasekaran , Thanasis Tsantilas, Optimal Routing Algorithms for Mesh-Connected Processor Arrays, Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, p.411-422, June 28-July 01, 1988
	9	L. G. Valiant, General purpose parallel architectures, Handbook of theoretical computer science (vol. A): algorithms and complexity, MIT Press, Cambridge, MA, 1991

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
  Gwo-Dong Chen ,  Daniel D. Gajski