Volume 25, Number 1, 1992
Volume 25, Number 2, 1992
: A Time-Space Hierarchy Between Polynomial Time and Polynomial Space.
, Siu-Wing Cheng
: Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks.
Volume 25, Number 3, 1992
: The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem.
: Structural Properties for Feasibly Computable Classes of Type Two.
Alan L. Selman
: A Survey of One-Way Functions in Complexity Theory.
Volume 25, Number 4, 1992
: The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems.
: Semigroups of Shift Register Counting Matrices.
: A Result About Languages Concerning Paperfolding Sequences.