Volume 21, Number 1, August 1980
: Finding Patterns Common to a Set of Strings.
: An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem.
: A-Transducers and the Monotonicity of IL Schemes.
Jeffrey M. Jaffe
: The Equivalence of RE Program Schemes and Data Flow Schemes.
Volume 21, Number 2, October 1980
Selected Papers from STOC 1979
Richard E. Ladner
: The Complexity of Problems in Systems of Communicating Sequential Processes.
: Lower Bounds on the Size of Sweeping Automata.
Volume 21, Number 3, December 1980
Nancy A. Lynch
: Straight-Line Program Length as a Parameter for Complexity Analysis.
: A Duality Theory for Decomposable Systems in a Category.
Harry R. Lewis
: Complexity Results for Classes of Quantificational Formulas.
Gaston H. Gonnet
: Open-Addressing Hashing with Unequal-Probability Keys.