Volume 51, Number 1, August 1995
Selected Papers of PODS 1990
Volume 51, Number 2, October 1995
: Separating the Communication Complexities of MOD m and MOD p Circuits.
Volume 51, Number 3, December 1995
Selected Papers of STOC 1992
: On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs.
: An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees.
: A Dichotomy Theorem for Maximum Generalized Satisfiability Problems.