Volume 12, Number 1, 13 February 1981
: The Numerical Instability of Bini's Algorithm.
Harold N. Gabow
: A Linear-Time Recognition Algorithm for Interval Dags.
: Solving Combinatorial Search Problems by Intelligent Backtracking.
Errol L. Lloyd
: Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources.
Volume 12, Number 2, 13 April 1981
: How Many Polynomials can be Approximated Faster Than They can be Evaluated?
: Presburger Arithmetic With Array Segments.
: Another Look at the Degree Constrained Subgraph Problem.
Mark H. Overmars
: General Methods for `All Elements' and `All Pairs' Problems.
: Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata.
: An Extension of Savitch's Theorem to Small Space Bounds.
Volume 12, Number 3, 13 June 1981
: The Simultaneous Accessibility of Two Configurations of Two Equivalent DPDA's.
Ronald V. Book
: The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen.
, Giancarlo Mauri
: On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems.
Volume 12, Number 4, 13 August 1981
: A Note on `A Cryptosystem for Multiple Communication'.
Martin E. Hellman
: Another Cryptanalytic Attack on `A Cryptosystem for Multiple Communication'.
: Generation of all the Balanced Parenthesis Strings in Lexicographical Order.
Aldo de Luca
: A Combinatorial Property of the Fibonacci Words.
Volume 12, Number 5, 13 October 1981
: On the Complexity of Simplifying Quadratic Forms.
: An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads.
: Protocols of Accessing Overlapping Sets of Resources.
: An Optimal Algorithm for Computing the Repetitions in a Word.
Moshe Y. Vardi
: The Decision Problem for Database Dependencies.
: A Sensitive Transitive Closure Algorithm.