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.

	AB90	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]
	Agg83	A. Aggarwal. On I/O placement in VLSI circuits. In 21st Allerton Conference on Communications, Control and Compulalion, pages 236-245, 1983.
	AL91	Bill Aiello , Tom Leighton, Coding theory, hypercube embeddings, and fault tolerance, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.125-136, July 21-24, 1991, Hilton Head, South Carolina, United States  [doi>10.1145/113379.113391]
	Ann89	F. Annexstein, Fault tolerance in hypercube-derivative networks, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.179-188, June 18-21, 1989, Santa Fe, New Mexico, United States  [doi>10.1145/72935.72955]
	BCS90	J. Bruck , R. Cypher , D. Soroker, Running algorithms efficiently on faulty hypercubes, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.37-44, July 02-06, 1990, Island of Crete, Greece  [doi>10.1145/97444.97455]
	Bil84	Gianfranco Bilardi, The area-time complexity of sorting (algorithms, computation, architecture, vlsi), 1985
	BS86	B. Becket and H.U. Simon. How robust is the n-cube? In Proceedings of the 27th Annual Symposium on Foundations of Computer Science. IEEE, 1986.
	HLN89	J. Hastad , T. Leighton, Fast computation using faulty hypercubes, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.251-263, May 14-17, 1989, Seattle, Washington, United States  [doi>10.1145/73007.73031]
	KKL+90	Kaklamanis, A.R. Karlin, F.T. Leighton, V. Milenkovic, P. Raghavan, S. Rag, C. Thomborson, and A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors. In Proceedings of lhe 31st Annual Symposium on FoundaIions of Computer Science. IEEE, 1990.
	Lei91	F. Thomson Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	LM89	F.T. Leighton and B. Maggs. Expanders might be practical" Fast algorithms for routing around faults on multibutterflies. in Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE, 1989.
	Mat92	Thomas R. Mathies, Percolation theory and computing with faulty arrays of processors, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.100-103, September 1992, Orlando, Florida, United States
	PV81	Franco P. Preparata , Jean Vuillemin, The cube-connected cycles: a versatile network for parallel computation, Communications of the ACM, v.24 n.5, p.300-309, May 1981  [doi>10.1145/358645.358660]
	Sch90	E. Schwabe, On the computational equivalence of hypercube-derived networks, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.388-397, July 02-06, 1990, Island of Crete, Greece  [doi>10.1145/97444.97706]
	Tam92	H. Tamaki. Efficient self-embedding of butterfly networks with random faults. submitted, 1992.

• 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
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• 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
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
  Gwo-Dong Chen ,  Daniel D. Gajski