Volume 21, Number 1, February 1992
: Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling.
Volume 21, Number 2, April 1992
: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata.
Pang C. Chen
: Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs.
: Lower Bounds for Threshold and Symmetric Functions in Parallel Computation.
Volume 21, Number 3, June 1992
B. K. Natarajan
: Probably Approximate Learning Over Classes of Distributions.
John H. Reif
, Sandeep Sen
: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems.
Pankaj K. Agarwal
: Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number.
: The Nilpotency Problem of One-Dimensional Cellular Automata.
Volume 21, Number 4, August 1992
: Circuit Definitions of Nondeterministic Complexity Classes.
: An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra.
: On the Structure of Bounded Queries to Arbitrary NP Sets.
Volume 21, Number 5, October 1992
: Increasing the Size of a Network by a Constant Factor can Increase Performance by more than a Constant Factor.
: Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions.
, Jue Xue
: Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs.
Volume 21, Number 6, December 1992
: On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae.
: Polynomial Time Productivity, Approximations, and Levelability.
: Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs.
: External Internal Nodes in Digital Search Trees via Mellin Transforms.