Volume 2, Number 1, March 1973
- Naftaly H. Minsky:
Representation of Binary Trees on Associative Memories.
1-5

- Gerard Salton:
Experiments in Multi-Lingual Information Retrieval.
6-11

- J. M. Robson:
An Improved Algorithm for Traversing Binary Trees Without Auxiliary Stack.
12-14

- Edward G. Coffman Jr.:
A Note on the Relative Performance of Two Disk Scanning Policies.
15-17

- R. A. Jarvis:
On the Identification of the Convex Hull of a Finite Set of Points in the Plane.
18-21

- Jaroslav Král, Jirí Demner:
A Note on the Number of States of the DeRemer's Recognizer.
22-23

- Gábor Várhegyi:
Numerical Differentiation of Experimental Data.
24-25

- Wolfgang Henhapl:
A Transformation of Marked Graphs.
26-29

Volume 2, Number 2, June 1973
Volume 2, Number 3, August 1973
Volume 2, Number 4, 1973
- Ravi Sethi:
A Note on Implementing Parallel Assignment Instructions.
91-95

- Stein Krogdahl:
A Dynamic Storage Allocation Problem.
96-99

- Jacques Cohen:
Syntax-Directed Unit Conversion.
100-102

- Gideon Yuval:
On a Problem Connected with Topological Sorting.
103-104

- Raymond R. Devillers, Guy Louchard:
Realization of Petri Nets Without Conditional Statements.
105-107

- Nick Roussopoulos:
A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C.
108-112

- Victor N. Kasyanov:
Some Properties of Fully Reducible Graphs.
113-117

- I. N. Molchanov, E. F. Galba:
On the Convergence of Difference Schemes Approximating a Plane Static Problem of the Theory of Elasticity with Mixed Boundary Conditions.
118-122

Volume 2, Number 5, December 1973
- Robert W. Floyd, Alan Jay Smith:
A Linear Time Two Tape Merge.
123-125

- J. K. R. Barnett:
A Technique for Reducing Comparison Times in Certain Applications of the Merging Method of Sorting.
127-128

- Henry S. Warren Jr.:
Minimal Comparison Sorting by Choosing Most Efficient Comparisons.
129-130

- Juhani Karhumäki:
An Example of a PD2L-System with the Growth Type 2½.
131-134

- Luc Boasson:
The Inclusion of the Substitution Closure of Linear and One-Counter Languages in the Largest Sub-AFL of the Family of Algebraic Languages is Proper.
135-140

- Nissim Francez, Giora Slutzki:
On the Non-Compactness of the Class of Program Schemas.
141-142

- Barry Dwyer:
Simple Algorithms for Traversing a Tree Without an Auxiliary Stack.
143-145

- H. T. Kung:
A New Upper Bound on the Complexity of Derivative Evaluation.
146-147

- H. Heuer, I. N. Molchanov:
Numerical Solution of a Boundary Problem for Equations of Elastic Equilibrium of Bodies in Transferences.
148-151

Volume 2, Number 6, April 1974
Last update Thu May 23 19:00:11 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page