Volume 23, Number 1, August 1981
Gérard P. Huet
: A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm.
: Corrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits.
Volume 23, Number 2, October 1981
Selected Papers from STOC 1980
: An Optimal Solution to a Wire-Routing Problem.
Nancy A. Lynch
: Upper Bounds for Static Resource Allocation in a Distributed System.
Volume 23, Number 3, December 1981
Alan L. Selman
: Some Observations on NP, Real Numbers and P-Selective Sets.
: Theft and Conspiracy in the Take-Grant Protection Model.
Ernst L. Leiss
: The Complexity of Restricted Regular Expressions and the Synthesis Problem for Finite Automata.