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	Irving M. Copi , Calvin C. Elgot , Jesse B. Wright, Realization of Events by Logical Nets, Journal of the ACM (JACM), v.5 n.2, p.181-196, April 1958  [doi>10.1145/320924.320931]
	2	Kleene, S., Represntatioln po90 fevents in nerve nets and finite automata, in automata studies, edited by O. shannon and mcgarthy princeton Univ. preess, 1956. pp 120-153.
	3	RaHIN, m., and scott D., finite automata and their problem. IBM J. Research dec. 3 (1959), 114-125.

• Dynamic initial allocation and local reallocation procedures for multiple stacks Communications of the ACM   29, 2
  D. Yun Yeh ,  Toshinori Munakata
  
  
• An Overview of the Theory of Computational Complexity Journal of the ACM (JACM)   18, 3
  J. Hartmanis ,  J. E. Hopcroft
  
  
• Approximation schemes for covering and packing problems in image processing and VLSI Journal of the ACM (JACM)   32, 1
  Dorit S. Hochbaum ,  Wolfgang Maass
  
  
• Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition ACM Transactions on Mathematical Software (TOMS)   4, 3
  Fred G. Gustavson
  
  
• A general-purpose algorithm for analyzing concurrent programs Communications of the ACM   26, 5
  Richard N. Taylor