Volume 22, Number 1, February 1993
: Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing.
: A Lower Bound on the Size of Shellsort Sorting Networks.
: An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection.
: Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space.
: NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems.
: Decomposing Finite-Valued Transducers and Deciding Their Equivalence.
Volume 22, Number 2, April 1993
: Theoretical Aspects of VLSI Pin Limitations.
Volume 22, Number 3, June 1993
: Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components.
: Inverting Polynomials and Formal Power Series.
Volume 22, Number 4, August 1993
: Regular Resolution Versus Unrestricted Resolution.
, Moni Naor
: Small-Bias Probability Spaces: Efficient Constructions and Applications.
Volume 22, Number 5, October 1993
Jack H. Lutz
: A Pseudorandom Oracle Characterization of BPP.
Volume 22, Number 6, December 1993
: A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors.
: On Finding the Rectangular Duals of Planar Triangular Graphs.
: A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times.