Volume 11, Number 1, February 1982
J. H. Halton
, Routo Terada
: A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One.
: Dynamic Programming is Optimal for Nonserial Optimization Problems.
: Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations.
Volume 11, Number 2, May 1982
James R. Bitner
: An Asymptotically Optimal Algorithm for the Dutch National Flag Problem.
: Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication.
: On the Accepting Density Hierarchy in NP.
Volume 11, Number 3, August 1982
Eitan M. Gurari
: The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable.
Dorit S. Hochbaum
: Approximation Algorithms for the Set Covering and Vertex Cover Problems.
Mikhail J. Atallah
: Finding the Cyclic Index of an Irreducible, Nonnegative Matrix.
: On Some Deterministic Space Complexity Problems.
Volume 11, Number 4, November 1982
: Predicting the Number of Distinct Elements in a Multiset.
Andrew Chi-Chih Yao
: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems.
: A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions.
: Optimization of Cost and Delay in Cellular Permutation Networks.