Volume 31, Number 1, January 1984
: Linear Programming in Linear Time When the Dimension Is Fixed.
Douglas R. Smith
: Random Trees and the Analysis of Branch and Bound Procedures.
Volume 31, Number 2, April 1984
: Finitely Specifiable Implicational Dependency Families.
Harry B. Hunt III
: Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes.
George M. Trojan
: Lower Bounds and Fast Algorithms for Sequence Acceleration.
: The Three-Machine No-Wait Flow Shop is NP-Complete.
, Debasis Mitra
: Asymptotic Expansions and Integral Representations of Moments of Queue Lengths in Closed Markovian Networks.
: The VLSI Complexity of Selected Graph Problems.
John E. Savage
: Space-Time Trade-Offs for Banded Matrix Problems.
Volume 31, Number 3, July 1984
: Efficient Schemes for Parallel Communication.
: A Formal Method for the Abstract Specification of Software.
: Analysis of Interleaved Storage Via a Constant-Service Queuing System with Markov-Chain-Driven Input.
Volume 31, Number 4, October 1984
Adam W. Bojanczyk
: Optimal Asynchronous Newton Method for the Solution of Nonlinear Equations.