Volume 4, Number 1, September 1975
Keijo Ruohonen:
Three Results of Comparison Between L Languages with and without Interaction.
7-10
Juhani Nieminen:
Some Observations on the Determination of an Upper Bound for the Clique Number of a Graph.
16-17
Volume 4, Number 2, November 1975
Andrzej Rowicki:
A Note on Optimal Scheduling for Two-Processor Systems.
27-30
Volume 4, Number 3, December 1975
Donald B. Johnson:
Priority Queues with Update and Finding Minimum Spanning Trees.
53-57
Doron Rotem:
On a Correspondence Between Binary Trees and a Certain Type of Permutation.
58-61
R. Christensen:
Crossvalidation: Minimizing the Entropy of the Future.
73-76
Judea Pearl:
On the Complexity of Inexact Computations.
77-81
Volume 4, Number 4, January 1976
Zvi Galil:
Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms.
85-87
David R. Hanson:
A Simple Variant of the Boundary-Tag Algorithm for the Allocation of Coroutine Environments.
109-112
Volume 4, Number 5, February 1976
Stanislaw Chrobot:
Layer - A Language Construction for Concurrent Structure Program Design.
113-117
Wolfgang Coy:
The Logical Meaning of Programs of a Subrecursive Language.
121-126
S. De Wolf,
G. De Mey:
Numerical Solution of Integral Equations for Potential Problems by a Variational Principle.
136-139
Volume 4, Number 6, March 1976
Gideon Yuval:
An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications.
155-156
data released under the ODC-BY 1.0 license
