Volume 35, Number 1, 15 June 1990
: A Short Proof of the Lexical Addressing Algorithm.
, Yahui Zhu
: An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube.
: A Model of Reconfiguration in Communicating Sequential Processes.
Volume 35, Number 2, 29 June 1990
: Counterexample to a Conjecture of Szymanski on Hypercube Routing.
: Probabilistic Self-Stabilization.
: On a Cyclic String-To-String Correction Problem.
: Obtaining Lazy Evaluation with Continuations in Scheme.
: Efficient Simulation of Circuits by Erew Prams.
: On Attribute Grammars Without Atribute Synthesis.
Volume 35, Number 3, 20 July 1990
Volume 35, Number 4, 7 August 1990
: Parallel Algorithm for Generating Permutations on Linear Array.
: The Communication Complexity for Decentralized Evaluation of Functions.
: Generating Pseudo-Random Permutations and Maximum Flow Algorithms.
: An Optimal Parallel Algorithm for Linear Programming in the Plane.
Volume 35, Number 5, 28 August 1990
: Simple Interpretations Among Complicated Theories.
: Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Volume 35, Number 6, 15 September 1990
: A Note on Terminal Balancing of Algebraic Systems.
: On the Depth Complexity of the Counting Functions.