Volume 33, Number 1, 27 October 1989
: On Access and Alignment of Data in a Parallel Processor.
Mila E. Majster-Cederbaum
: The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces.
: A Simple Proof of a Simple Consensus Algorithm.
: Leader Election in the Presence of n-1 Initial Failures.
: Comments on ``A Comparison of Concatenated and Superimposed Code Word Surrogate Files for Very Large Data/Knowledge Bases''.
: Prime Numbers as a Tool to Design Distributed Algorithms.
Volume 33, Number 2, 10 November 1989
Volume 33, Number 3, 30 November 1989
: The Lexicographically First Topological Order Problem is NLOG-Complete.
: Software-Controlled Cache Coherence Protocol for Multicache Systems.
E. Robert McCurley
: Auxiliary Variables in Partial Correctness Programming Logics.
Volume 33, Number 4, 21 December 1989
: Finding the Upper Envelope of n Line Segments in O(n log n) Time.
: An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time.
: A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph.
Volume 33, Number 5, 10 January 1990
: A Result Relating Disjunctive Self-Reducibility to P-Immunity.
: On the Deterministic Complexity of Factoring Polynomials over Finite Fields.
Volume 33, Number 6, 10 February 1990
: A Generalization of Chvátal's Star-Cutset Lemma.
, Kunsoo Park
: A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming.
: A Predicate Transformer for Progress.