Volume 50, Number 1, February 1995
: Load Sharing with Parallel Priority Queues.
: On the Computational Complexity of Finite Cellular Automata.
: Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms.
Volume 50, Number 2, April 1995
Selected Papers from STOC 1991
: Approximations and Optimal Geometric Divide-an-Conquer.
Harold N. Gabow
: A Matroid Approach to Finding Edge Connectivity and Packing Arborescences.
: Effective Noether Irreducibility Forms and Applications.
Volume 50, Number 3, June 1995
Selected Papers of the Sixth Annual Conference on Structure in Complexity Theory, June 30 - July 3, 1991
Selected Papers of the Seventh Annual Conference on Structure in Complexity Theory, June 22-25, 1992
Selected Papers of the Fifth Annual Workshop on Computational Learning Theory (COLT), July 27-29, 1992