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 Alstrup , Dov Harel , Peter W. Lauridsen , Mikkel Thorup, Dominators in Linear Time, SIAM Journal on Computing, v.28 n.6, p.2117-2132, Dec. 1999  [doi>10.1137/S0097539797317263]
	2	Stephen Alstrup and Peter W. Lauridsen. A simple and optimal algorithm for finding immediate dominators in reducible graphs. Technical Report D-261/96, TOPPS Bibliography, 1996.
	3	Stephen Alstrup, Peter W. Lauridsen, and Mikkel Thorup. Dominators in linear time. Technical Report 96/35, Department of Computer Science, University of Copenhagen, 1996.
	4	Adam L. Buchsbaum , Haim Kaplan , Anne Rogers , Jeffery R. Westbrook, A new, simpler linear-time dominators algorithm, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.6, p.1265-1296, Nov. 1998  [doi>10.1145/295656.295663]
	5	Jong-Deok Choi , Ron Cytron , Jeanne Ferrante, Automatic construction of sparse data flow evaluation graphs, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.55-66, January 21-23, 1991, Orlando, Florida, United States  [doi>10.1145/99583.99594]
	6	Ron Cytron , Andy Lowry , F. Kenneth Zadeck, Code motion of control structures in high-level languages, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.70-85, January 01, 1986, St. Petersburg Beach, Florida  [doi>10.1145/512644.512651]
	7	Ron Cytron , Jeanne Ferrante , Barry K. Rosen , Mark N. Wegman , F. Kenneth Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.4, p.451-490, Oct. 1991  [doi>10.1145/115372.115320]
	8	Harold N. Gabow, Data structures for weighted matching and nearest common ancestors with linking, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.434-443, January 22-24, 1990, San Francisco, California, United States
	9	Paul Havlak, Nesting of reducible and irreducible loops, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.4, p.557-567, July 1997  [doi>10.1145/262004.262005]
	10	Thomas Lengauer , Robert Endre Tarjan, A fast algorithm for finding dominators in a flowgraph, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.1, p.121-141, July 1979  [doi>10.1145/357062.357071]
	11	Robert Morgan, Building an optimizing compiler, Digital Press, Newton, MA, 1998
	12	Keshav Pingali , Gianfranco Bilardi, Optimal control dependence computation and the Roman chariots problem, ACM Transactions on Programming Languages and Systems (TOPLAS), v.19 n.3, p.462-491, May 1997  [doi>10.1145/256167.256217]
	13	G. Ramalingam, Identifying loops in almost linear time, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.2, p.175-188, March 1999  [doi>10.1145/316686.316687]
	14	G. Ramalingam. On loops, dominators, and dominance frontiers. Technical Report RC21513, IBM Research Division, June 1999.
	15	G. Ramalingam , Thomas Reps, An incremental algorithm for maintaining the dominator tree of a reducible flowgraph, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.287-296, January 16-19, 1994, Portland, Oregon, United States  [doi>10.1145/174675.177905]
	16	Vugranam C. Sreedhar , Guang R. Gao, A linear time algorithm for placing &phgr;-nodes, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.62-73, January 23-25, 1995, San Francisco, California, United States  [doi>10.1145/199448.199464]
	17	Vugranam C. Sreedhar , Guang R. Gao , Yong-Fong Lee, Identifying loops using DJ graphs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.6, p.649-658, Nov. 1996  [doi>10.1145/236114.236115]
	18	B. Steensgaard. Sequentializing program dependence graphs for irreducible programs. Technical Report MSR-TR-93-14, Microsoft Research, Redmond, Wash., October 1993.
	19	Robert E. Tarjan. Testing flow graph reducibility. J. Comput. Syst. Sci., 9:355-365, 1974.
	20	Michael Weiss, The transitive closure of control dependence: the iterated join, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.2, p.178-190, June 1992  [doi>10.1145/151333.151337]

• 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 conference on Design automation
  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
  
  

• ACM SIGPLAN Notices
  Volume 35 ,  Issue 5   May 2000