Volume 4, Number 1, September 1975
: Three Results of Comparison Between L Languages with and without Interaction.
: Some Observations on the Determination of an Upper Bound for the Clique Number of a Graph.
Volume 4, Number 2, November 1975
Volume 4, Number 3, December 1975
Donald B. Johnson
: Priority Queues with Update and Finding Minimum Spanning Trees.
: On a Correspondence Between Binary Trees and a Certain Type of Permutation.
: Crossvalidation: Minimizing the Entropy of the Future.
: On the Complexity of Inexact Computations.
Volume 4, Number 4, January 1976
: Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms.
David R. Hanson
: A Simple Variant of the Boundary-Tag Algorithm for the Allocation of Coroutine Environments.
Volume 4, Number 5, February 1976
: Layer - A Language Construction for Concurrent Structure Program Design.
: The Logical Meaning of Programs of a Subrecursive Language.
S. De Wolf
, G. De Mey
: Numerical Solution of Integral Equations for Potential Problems by a Variational Principle.
Volume 4, Number 6, March 1976
: An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications.