Volume 25, Number 1, January 1978
: Renamings and Economy of Memory in Program Schemata.
Ronald V. Book
: Simple Representations of Certain Classes of Languages.
W. Morven Gentleman
: Some Complexity Results for Matrix Computations on Parallel Processors.
Oscar H. Ibarra
: Reversal-Bounded Multicounter Machines and Their Decision Problems.
: A New Incompleteness Result for Hoare's System.
Volume 25, Number 2, April 1978
Edward C. Horvath
: Stable Sorting in Asymptotically Optimal Time and Extra Space.
John M. Mulvey
: Pivot Strategies for Primal-Simplex Network Codes.
David R. Musser
: On the Efficiency of a Polynomial Irreducibility Test.
: The Complexity of Some Problems on Subsequences and Supersequences.
Volume 25, Number 3, July 1978
Herbert S. Wilf
: A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane.
Jon T. Butler
: Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates.
Volume 25, Number 4, October 1978
Leonidas J. Guibas
: The Analysis of Hashing Techniques That Exhibit k-ary Clustering.
: Path Calculus in Program Verification.
: Conditional Expressions with Equality Tests.