Volume 7, Number 1, February 1978
Richard J. Lipton
: Polynomials with 0-1 Coefficients that Are Hard to Evaluate.
Stephen A. Cook
: Soundness and Completeness of an Axiom System for Program Verification.
Robert L. Probert
: An Extension of Computational Duality to Sequences of Bilinear Computations.
: The Time Measure of One-Tape Turing Machines Does Not Have the Parallel Computation Property.
Volume 7, Number 2, May 1978
Michael L. Fredman
: Observations on the Complexity of Generating Quasi-Gray Codes.
: Rudimentary Predicates and Relative Computation.
Volume 7, Number 3, August 1978
Kellogg S. Booth
: Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems.
Mark R. Brown
: Implementation and Analysis of Binomial Queue Algorithms.
E. Mark Gold
: Deadlock Prediction: Easy and Difficult Cases.
Brenda S. Baker
: Generalized Syntax Directed Translation, Tree Transducers, and Linear Space.
Volume 7, Number 4, November 1978
: Generating t-ary Trees Lexicographically.
David A. Plaisted
: Some Polynomial and Integer Divisibility problems are NP-Hard.
Oscar H. Ibarra
: The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications.
Theodore P. Baker
: A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension.