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	Stephen A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, p.151-158, May 03-05, 1971, Shaker Heights, Ohio, United States  [doi>10.1145/800157.805047]
	2	KAnP, R. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85-103.
	3	LYNCH, N. Complexity-class encoding sets. Submitted fer publication.
	4	LYNCH, N. Helping: Several formalizations. J. Symbolic Logic (to appear).
	5	LYNch, N., MEYEn, A., AND FmcnEn, M. Relativization of the theory of computational complexity. Trans. AMS (to appear).
	6	A. R. Meyer, WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE, Massachusetts Institute of Technology, Cambridge, MA, 1973
	7	STOCKMEYEn, L. Ph.D. Th., Dep. of Elec. Eng., M.I.T., Cambridge, Mass., June 1974.
	8	SOLOVAY, R. Private communication.

• 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