Volume 19, Number 1, February 1990
: A Density Theorem for Purely Iterative Zero Finding Methods.
: Very Simple Methods for All Pairs Network Flow Analysis.
Volume 19, Number 2, April 1990
David A. Plaisted
: A Heuristic Algorithm for Small Separators in Arbitrary Graphs.
Pankaj K. Agarwal
, Micha Sharir
: Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection.
Volume 19, Number 3, June 1990
: Deciding Equivalence of Finite Tree Automata.
: A Class of Projective Transformations for Linear Programming.
: The Euclidean Algorithm and the Degree of the Gauss Map.
Volume 19, Number 4, August 1990
David M. Mount
: The Number of Shortest Paths on the Surface of a Polyhedron.
Francis Y. L. Chin
, H. F. Ting
: Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees.
: Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4-Flow.
: Planar Depth-First Search in O(log n) Parallel Time.
Wansoo T. Rhee
: A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size.
Douglas R. Stinson
: Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n).
Mark W. Krentel
: On Finding and Verifying Locally Optimal Solutions.
: The Structure of Polynomial Ideals and Gröbner Bases.
Volume 19, Number 5, October 1990
: Linear-Time Test for Small Face Covers in Any Fixed Surface.
Volume 19, Number 6, December 1990
: Random Polynomials and Approximate Zeros of Newton's Method.
Jack H. Lutz
: Category and Measure in Complexity Classes.
: Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation.