Volume 34, Number 1, 22 February 1990
: Flush Primitives for Asynchronous Distributed Systems.
: Separability and the Detection of Hidden Channels.
: Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions.
Volume 34, Number 2, 16 March 1990
Volume 34, Number 3, 9 April 1990
Jean Marcel Pallo
: A Distance Metric on Binary Trees Using Lattice-Theoretic Measures.
: Towards a Theory of (Self) Applicative Communicating Processes: A Short Note.
: Logic VS. Complexity Theoretic Properties of the Graph Accessibility Problem for Directed Graphs of Bounded Degree.
John C. Tipper
: A Straightforward Iterative Algorithm for the Planar Voronoi Diagram.
: Preemptive Scheduling of Independent Jobs with Releas Times and Deadlines on a Hypercube.
Volume 34, Number 4, 24 April 1990
: Recognizing Breadth-First Search Trees in Linear Time.
Laxmikant V. Kalé
: An Almost Perfect Heuristic for the N Nonattacking Queens Problem.
: Coloring Algorithms for K_5-Minor Free Graphs.
Volume 34, Number 5, 7 May 1990
Paul E. S. Dunne
: Comment on Kochol's Paper ``Efficient Monotone Circuits for Threshold Functions''.
: Periodic String Division Generated by Deterministic L Systems.
Sung Kwon Kim
: A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular Arcs of a Circle.
: A Unifying Framework for Trie Design Heuristics.
: Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies.
R. T. Kuo
, S. S. Tseng
: The Necessary and Sufficient Condition for the Worst-Case Male Optimal Stable Matching.
J. M. Robson
: Random Access Machines with Multi-Dimensional Memories.
: Tight Lower Bounds on the Length of Word Chains.
Volume 34, Number 6, 28 May 1990
Lenwood S. Heath
: Covering a Set with Arithmetic Progressions is NP-Complete.