Information Processing Letters, Vol. 2

Volume 2, Number 1, March 1973

Naftaly H. Minsky: Representation of Binary Trees on Associative Memories. 1-5 BibTeX
Gerard Salton: Experiments in Multi-Lingual Information Retrieval. 6-11 BibTeX
J. M. Robson: An Improved Algorithm for Traversing Binary Trees Without Auxiliary Stack. 12-14 BibTeX
Edward G. Coffman Jr.: A Note on the Relative Performance of Two Disk Scanning Policies. 15-17 BibTeX
R. A. Jarvis: On the Identification of the Convex Hull of a Finite Set of Points in the Plane. 18-21 BibTeX
Jaroslav Král, Jirí Demner: A Note on the Number of States of the DeRemer's Recognizer. 22-23 BibTeX
Gábor Várhegyi: Numerical Differentiation of Experimental Data. 24-25 BibTeX
Wolfgang Henhapl: A Transformation of Marked Graphs. 26-29 BibTeX

Armin B. Cremers, Hermann A. Maurer, Otto Mayer: A Note on Leftmost Restricted Random Context Grammars. 31-33 BibTeX
S. I. Roschke, Antonio L. Furtado: An Algorithm for Obtaining the Chromatic Number and an Optimal Coloring of a Graph. 34-38 BibTeX
Joël Coffy: On Computing the Time Complexity of Transitive Closure Algorithms. 39-42 BibTeX
Azriel Rosenfeld, David L. Milgram: Parallel / Sequential Array Automata. 43-46 BibTeX
Gary Lindstrom: Scanning List Structures Without Stacks or Tag Bits. 47-51 BibTeX
Edward N. Adams III: Another Representation of Binary Tree Traversal. 52-54 BibTeX
D. Holnapy, Miklós Szöts, A. Botár: A Generalization of the Method of Finite Differences. 55-59 BibTeX

Gabor T. Herman: On Universal Computer-Constructors. 61-64 BibTeX
Donald T. Tang, C. K. Wong: A Modified Branch-and-Bound Strategy. 65-69 BibTeX
Andrzej Ehrenfeucht, Grzegorz Rozenberg: A Limit Theorem for Sets of Subwords in Deterministic T0L Languages. 70-73 BibTeX
Masaharu Mizumoto, Jun'ichi Toyoda, Kohkichi Tanaka: Examples of Formal Grammars with Weights. 74-78 BibTeX
T. B. Boffey: Applying the Minimax Rule Over Graphs Which Are Not Trees. 79-81 BibTeX
C. A. R. Hoare: A General Conservation Law for Queueing Disciplines. 82-85 BibTeX
I. N. Molchanov, M. F. Iakovlev: On One Class of Iterative Methods for Obtaining the Generalized Solution of Non-Consistent Systems of Linear Algebraic Equations. 86-90 BibTeX

Ravi Sethi: A Note on Implementing Parallel Assignment Instructions. 91-95 BibTeX
Stein Krogdahl: A Dynamic Storage Allocation Problem. 96-99 BibTeX
Jacques Cohen: Syntax-Directed Unit Conversion. 100-102 BibTeX
Gideon Yuval: On a Problem Connected with Topological Sorting. 103-104 BibTeX
Raymond R. Devillers, Guy Louchard: Realization of Petri Nets Without Conditional Statements. 105-107 BibTeX
Nick Roussopoulos: A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C. 108-112 BibTeX
Victor N. Kasyanov: Some Properties of Fully Reducible Graphs. 113-117 BibTeX
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- BibTeX

Robert W. Floyd, Alan Jay Smith: A Linear Time Two Tape Merge. 123-125 BibTeX
J. K. R. Barnett: A Technique for Reducing Comparison Times in Certain Applications of the Merging Method of Sorting. 127-128 BibTeX
Henry S. Warren Jr.: Minimal Comparison Sorting by Choosing Most Efficient Comparisons. 129-130 BibTeX
Juhani Karhumäki: An Example of a PD2L-System with the Growth Type 2½. 131-134 BibTeX
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 BibTeX
Nissim Francez, Giora Slutzki: On the Non-Compactness of the Class of Program Schemas. 141-142 BibTeX
Barry Dwyer: Simple Algorithms for Traversing a Tree Without an Auxiliary Stack. 143-145 BibTeX
H. T. Kung: A New Upper Bound on the Complexity of Derivative Evaluation. 146-147 BibTeX
H. Heuer, I. N. Molchanov: Numerical Solution of a Boundary Problem for Equations of Elastic Equilibrium of Bodies in Transferences. 148-151 BibTeX

Donald E. Knuth, Jayme Luiz Szwarcfiter: A Structured Program to Generate all Topological Sorting Arrangements. 153-157 BibTeX
N. Solntseff: On a Notational Device for the Description of Pointer-Free Operations on Structured Data. 158-159 BibTeX
Robert Endre Tarjan: A Note on Finding the Bridges of a Graph. 160-161 BibTeX
Robert B. K. Dewar: A Stable Minimum Storage Sorting Algorithm. 162-164 BibTeX
C. A. R. Hoare: Optimization of Store Size for Garbage Collection. 165-166 BibTeX
A. G. Middleton: Cost-Oriented Program Optimisation. 167-170 BibTeX
A. Hansal: "Software Devices" for Processing Graphs Using PL/I Compile Time Facilities. 171-179 BibTeX
L. Wayne Jackson, Subrata Dasgupta: The Identification of Parallel Micro-Operations. 180-184 BibTeX
K. P. Lee, Grzegorz Rozenberg: The Length Sets of D0L Languages are Uniformly Bounded. 185-188 BibTeX