Volume 37, Number 1, 10 January 1991
: Overlap Closures do not Suffice for Termination of General Term Rewriting Systems.
: An Optimal Greedy Heuristic to Color Interval Graphs.
: Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete.
Volume 37, Number 2, 31 January 1991
: An Incremental Reconstruction Method for Dynamic Planar Point Location.
: An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon.
: An Optimal Algorithm for Deleting the Root of a Heap.
Volume 37, Number 3, 18 February 1991
: A Simple Algorithm for Computing the Smallest Enclosing Circle.
: Traversing Graphs in a Paging Environment, BFS or DFS?
Galen H. Sasaki
: The Effect of the Density of States on the Metropolis Algorithm.
Dung T. Huynh
: The Effective Entropies of Some Extensions of Context-Free Languages.
Volume 37, Number 4, 28 February 1991
Robert W. Irving
: On Approximating the Minimum Independent Dominating Set.
: An Extension of Khrapchenko's Theorem.
Maria J. Serna
: Approximating Linear Programming is Log-Space Complete for P.
Volume 37, Number 5, 14 March 1991
: An Undecidable Problem About Rational Sets and Contour Words of Polyominoes.
: Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials.
: On Learning from Queries and Counterexamples in the Presence of Noise.
: On the Nonexistence of Resilient Consensus Protocols.
Volume 37, Number 6, 28 March 1991
: A Note on the Notation of Recursion in Process Algebras.
: Semantics-Directed Compilation of Nonlinear Patterns.
: A Very Simple Construction of 1-Writer Multireader Multivalued Atomic Variable.