Volume 20, Number 1, 2 January 1985
: Some Properties of Commutation in Free Partially Commutative Monoids.
: On Equivalence of Relational and Network Database Models.
Volume 20, Number 2, 15 February 1985
David A. Plaisted
: The Undecidability of Self-Embedding for Term Rewriting Systems.
: A Comment on the `Basic Security Theorem' of Bell and LaPadula.
: Translation of Turner Combinators in O(n log n) Space.
Satish R. Thatte
: On the Correspondence Metween Two Classes of Reduction Systems.
: Upper Bounds on the Size of LR(k) Parsers.
Volume 20, Number 3, 8 April 1985
Ernest C. Njau
: Details of Distortions in the Computed Fourier Transforms of Signals - Part I: Short Periodic Signals.
Mee Yee Chan
: A Note on Redundant Disk Modulo Allocation.
Alain J. Martin
: The Probe: An Addition to Communication Primitives.
: An Undecidable Problem for Context-Free Grammars.
Yung H. Tsin
: An Optimal Parallel Processor Bound in Strong Orientation of an Undirected Graph.
: Some Results on Addition/Subtraction Chains.
Volume 20, Number 4, 10 May 1985
: Constructing the Visibility Graph for n-Line Segments in O(n²) Time.
: Global and Logical Time in Distributed Algorithms.
David S. Wise
: Representing Matrices as Quadtrees for Parallel Processors.
J. Mark Keil
: Finding Hamiltonian Circuits in Interval Graphs.
W. J. Van Gils
: How to Cope with Faulty Processors in a Completely Connected Network of Communicating Processors.
Volume 20, Number 5, 12 June 1985
John H. Reif
: Depth-First Search is Inherently Sequential.
: On Efficient Parallel Strong Orientation.
: Independence Results About Context-Free Languages and Lower Bounds.
James R. Bitner
: Storing Matrices on Disk for Efficient Row and Column Retrieval.
: A Note on the Expected Time Required to Construct the Outer Layer.