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	M. L. BALINSKI, An algorithm for finding all vertices of convex polyhedral sets, J. Soc. Indust. Appl. Mathem., 9, {March 1961}
	2	A. CHARNES, W. W. COOPER and A. HENDERSON, An Introduction to Linear Programming, J.Wiley, New-York, {1953}
	3	P. COUSOT and R. COUSOT, Static determination of dynamic properties of programs, 2nd Int. Symposium on Programming, B. Robinet(Ed.), Dunod, Paris, {1976}
	4	Patrick Cousot , Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.238-252, January 17-19, 1977, Los Angeles, California  [doi>10.1145/512950.512973]
	5	N. E. DYER and L. G. PROLL, An algorithm for determining all extreme points of a convex polytope, Mathematical Programming, 12, {1977}
	6	M. KARR, Affine relationships among variables of a program, Acta Informatica, 6, {1976}
	7	V. KLEE, Some characterizations of convex polyhedra, Acta Mathematica, 102, {1959}
	8	V. KLEE, On the number of vertices of a convex polytope, Canadian J. of Mathematics, 16,{1964}
	9	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	10	H. W. KUHN, Solvability and consistency for linear equations and inequalities, Amer. Math. Monthly, 63, {1956}
	11	E. LANERY, Recherche d'un système générateur minimal d'un polyhedre convexe, Thèse de 3ème cycle, Caen, France, {1966}
	12	M. MANAS and J. NEDOMA, Finding all vertices of a convex polyhedron, Numerische Mathematik, 12, {1968}
	13	T. H. MATTHEIS, An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities, Operations Research, 21, {1973}
	14	T. L. SAATY, The number of vertices of a polyhedron, Amer. Math. Monthly, 62, {1955}
	15	M. SIMONNARD, Programmation Linéaire, Dunod, Paris, {1973}
	16	Norihisa Suzuki , Kiyoshi Ishihata, Implementation of an array bound checker, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.132-143, January 17-19, 1977, Los Angeles, California  [doi>10.1145/512950.512963]
	17	B. WEGBREIT, Property extraction in well founded property sets, IEEE Trans. on Soft. Eng., vol. SE-1, no3, {Sept.1975}
	18	H. WEYL, The elementary theory of convex polyhedra, Annals of Math. Study, 24, {1950}

• 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
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE Design Automation Conference on
  Gwo-Dong Chen ,  Daniel D. Gajski
  
  
• 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