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	J. Gary Augustson , Jack Minker, An Analysis of Some Graph Theoretical Cluster Techniques, Journal of the ACM (JACM), v.17 n.4, p.571-588, Oct. 1970  [doi>10.1145/321607.321608]
	2	, BIERSTONE, E. Cliques and generalized cliques in a finite linear graph. Unpublished report.
	3	BRON, COEN, AND KERBOSCH, JOEP A. G.M. Private communication.
	4	MULLIGAN, G.D. Algorithms for finding cliques of a graph. M.Sc. thesis, Dep. of Computer Sei., U. of Toronto, Toronto, Ontario, Can.

• 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