Volume 25, Number 1, April 1987
: A Fast Parallel Coloring of Planar Graphs with Five Colors.
Cao An Wang
, Yung H. Tsin
: An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane.
John H. Reif
: A Topological Approach to Dynamic Graph Connectivity.
Volume 25, Number 2, May 1987
: Predicative Specifications for Functional Programs Describing Communication Networks.
Alan M. Frieze
: Parallel Algorithms for Finding Hamilton Cycles in Random Graphs.
F. Miller Maley
: An Observation Concerning Constraint-Based Compaction.
Victor J. Rayward-Smith
: The Complexity of Preemptive Scheduling Given Interprocessor Communication Delays.
Volume 25, Number 3, May 1987
: Counterexamples to Termination for the Direct Sum of Term Rewriting Systems.
: A Lower Bound on the Complexity of the Convex Hull Problem for Simple Polyhedra.
: Stopping Times of Distributed Consensus Protocols: A Probabilistic Analysis.
: Local Authentication in Insecure Environments.
T. H. Tse
: On the Detection of Unstructuredness in Flowgraphs.
: Transformations for Communication Fairness in CSP.
Volume 25, Number 4, June 1987
: A Note on the Number of Leftist Trees.
: Remark on the Hsu-Du New Algorithm for the Longest Common Subsequence Problem.
: An \Omega(\sqrt(n)) Lower Bound for the Nonoptimality of the Greedy Triangulation.
Andrew W. Appel
: Garbage Collection can be Faster than Stack Allocation.
Volume 25, Number 5, July 1987
: Super-Exponentials Nonprimitive Recursive, but Rudimentary.
: A Note on Graham's Convex Hull Algorithm.
Volume 25, Number 6, July 1987
: Generalized Lower Bounds Derived from Hastad's Main Lemma.
: The Area-Time Complexity of the VLSI Counter.
: Determining Connected Components in Linear Time by a linear Number of Processors.
: The Complexity of Strict Serializability Revisited.