External Links

    Journal: Inf. Process. Lett.

    Volume 2, Issue 6

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

    Volume 2, Issue 5

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

    Volume 2, Issue 4

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

    Volume 2, Issue 3

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

    Volume 2, Issue 2

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

    Volume 2, Issue 1

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