Volume 30, Number 1, January 1989
: A Note on Word Chains and Regular Languages.
Ravi S. Sandhu
: The Reflected Tree Hierarchy for Protection and Sharing.
: Lower Bounds for Synchronous Circuits and Planar Circuits.
Volume 30, Number 2, January 1989
: An Image Algorithm for Computing the Hausdorff Distance Efficiently in Linear Time.
: On Coupling and the Approximation of the Permanent.
Volume 30, Number 3, February 1989
J. Scott Provan
: Shortest Enclosing Walks and Cycles in Embedded Graphs.
: The Pitfall Paradox and its Solution with Virtual Objects.
Karel Culik II
: Variations of the Firing Squad Problem and Applications.
Volume 30, Number 4, February 1989
: Average Number of Messages for Distributed Leader-Finding in Rings of Processors.
: Self-Adjusting and Split Sequence Hash Tables.
: A Distributed Algorithm for Multiple Entries to a Critical Section.
: Global Quiescence Detection Based on Credit Distribution and Recovery.
J. M. Robson
: Separating Strings with Small Automata.
Volume 30, Number 5, March 1989
: An Elegant 1-Writer Multireader Multivalued Atomic Register.
: Graphs with Small Chromatic Numbers are Easy to Color.
Moshe Y. Vardi
: A Note on the Reduction of Two-Way Automata to One-Way Automata.
Volume 30, Number 6, March 1989
: A New Approach to Optimal Cache Scheduling.