Volume 30, Number 1, January 1989
Peter Roth:
A Note on Word Chains and Regular Languages.
15-18
Ravi S. Sandhu:
The Reflected Tree Hierarchy for Protection and Sharing.
21-26
György Turán:
Lower Bounds for Synchronous Circuits and Planar Circuits.
37-40
Volume 30, Number 2, January 1989
Ron Shonkwiler:
An Image Algorithm for Computing the Hausdorff Distance Efficiently in Linear Time.
87-89
Milena Mihail:
On Coupling and the Approximation of the Permanent.
91-95
Volume 30, Number 3, February 1989
J. Scott Provan:
Shortest Enclosing Walks and Cycles in Embedded Graphs.
119-125
Udo Kelter:
The Pitfall Paradox and its Solution with Virtual Objects.
139-143
Karel Culik II:
Variations of the Firing Squad Problem and Applications.
153-157
Volume 30, Number 4, February 1989
Christian Lavault:
Average Number of Messages for Distributed Leader-Finding in Rings of Processors.
167-176
James Wogulis:
Self-Adjusting and Split Sequence Hash Tables.
185-188
Kerry Raymond:
A Distributed Algorithm for Multiple Entries to a Critical Section.
189-193
Friedemann Mattern:
Global Quiescence Detection Based on Credit Distribution and Recovery.
195-200
J. M. Robson:
Separating Strings with Small Automata.
209-214
Volume 30, Number 5, March 1989
K. Vidyasankar:
An Elegant 1-Writer Multireader Multivalued Atomic Register.
221-223
Ludek Kucera:
Graphs with Small Chromatic Numbers are Easy to Color.
233-236
Moshe Y. Vardi:
A Note on the Reduction of Two-Way Automata to One-Way Automata.
261-264
Volume 30, Number 6, March 1989
Carsten Vogt:
A New Approach to Optimal Cache Scheduling.
303-310
data released under the ODC-BY 1.0 license
