Information Processing Letters, Vol. 1

Volume 1, Number 1, February 1971

• G. M. Stacey: The Role of Virtual Memory in the Handling of Application Files. 1-3
• F. G. Duncan, D. Zissos: Programmed Simulation of Sequential Circuits. 4-6
• Hermann A. Maurer: The Solution of a Problem by Ginsburg. 7-10
• D. Zissos, F. G. Duncan: Programmed Simulation of Race Hazards in Sequential Circuits. 11-13
• Wolfgang Henhapl, Cliff B. Jones: A Run-Time Mechanism for Referencing Variables. 14-16
• T. H. Merrett: General Programs for Management Systems. 17-20
• Hans Karlgren: Stacking Without Really Stacking When Reducing Categorical Expressions. 21-22
• Donald E. Knuth, Robert W. Floyd: Notes on Avoiding "go to" Statements. 23-31 , Errata: Inf. Process. Lett. 1(4): 177(1972)
• John E. Hopcroft, Robert Endre Tarjan: A V² Algorithm for Determining Isomorphism of Planar Graphs. 32-34

Volume 1, Number 2, July 1971

• Gerard Salton: The Performance of Interactive Information Retrieval. 35-41
• Dennis Tsichritzis: A Note on Comparison of Subrecursive Hierarchies. 42-44
• B. F. Caviness, P. L. Pollack, C. M. Rubald: An Existence Lemma for Canonical Forms in Symbolic Mathematics. 45-46
• David L. Milgram, Azriel Rosenfeld: A Note on Scattered Context Grammars. 47-50
• Derek G. Corneil: An n² Algorithm for Determining the Bridges of a Graph. 51-55
• J. Ian Munro: Efficient Determination of the Transitive Closure of a Directed Graph. 56-58
• Erol Gelenbe: The Two-Thirds Rule for Dynamic Storage Allocation Under Equilibrium. 59-60
• H. Scheidig: Representation and Equality of Modes. 61-65
• Allan Borodin, J. Ian Munro: Evaluating Polynomials at Many Points. 66-68

Volume 1, Number 3, February 1972

• Spyros G. Tzafestas: Input-Output Modeling and Identification of Linear Automata. 69-75
• John C. Ogilvie, C. L. Olson: On the Use of Complete Subgraphs in Cluster Analysis. 76-79
• Andries van Dam, Frank Wm. Tompa: Software Data Paging and Segmentation for Complex Systems. 80-86
• J. F. Whale: The Critical Value of the Basic Parameter of a Nonlinear Differential Equation. 87-90
• N. Solntseff: A Classification of Extensible Programming Languages. 91-96
• N. Solntseff, A. Yezerski: ECT - An Extensible-Contractable Translator System. 97-99
• David Gries: Programming by Induction. 100-107
• Rainer Zimmer: Soft Precedence. 108-110
• Gerhard Chroust: Expression Evaluation with Minimum Average Working Storage. 111-114
• Brian H. Mayoh: Recursion and Stacks. 115-116
• Coenraad Bron: Outline of a Machine Without Branch Instructions. 117-119
• Robert Endre Tarjan: Determining Whether a Groupoid is a Group. 120-124

Volume 1, Number 4, June 1972

• Dennis Tsichritzis: Protection in Operating Systems. 127-131
• Ronald L. Graham: An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. 132-133
• John M. Carroll, William Fraser, Gregory Gill: Automatic Content Analysis in an On-Line Environment. 134-140
• Paul Branquart, Jean-Pierre Cardinael, Jean-Paul Delescaille, Johan Lewi: A Context-Free Syntax of ALGOL 68. 141-148
• Laurent Siklóssy: Fast and Read-Only Algorithms for Traversing Trees Without an Auxiliary Stack. 149-152
• Godfried T. Toussaint: Feature Evaluation with Quadratic Mutual Information. 153-156
• Ellis Horowitz: A Fast Method for Interpolation Using Preconditioning. 157-163 , Errata: Inf. Process. Lett. 1(5): 216(1972)
• Jaroslav Král: A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths. 164-167 , Errata: Jaroslav Král: Errata: A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths. Inf. Process. Lett. 1(5): 216(1972)
• I. N. Molchanov, L. D. Nikolenko: On an Approach to Integrating Boundary Problems With a Non-Unique Solution. 168-172
• Donald E. Knuth, E. B. Kaehler: An Experiment in Optimal Sorting. 173-176
• Donald E. Knuth, Robert W. Floyd: Errata: Notes on Avoiding "go to" Statements. 177 , ->Inf. Process. Lett. 1(1): 23-31(1971)

Volume 1, Number 5, October 1972

• Edsger W. Dijkstra: Information Streams Sharing a Finite Buffer. 179-180
• Hendrik Vantilborgh, Axel van Lamsweerde: On an Extension of Dijkstra's Semaphore Primitives. 181-186
• R. C. Varney: Priority Processes Used for Scheduling Within a Tree Structured Operating System. 187-190
• Nicholas V. Findler: Short Note on a Heuristic Search Strategy in Long-Term Memory Networks. 191-196
• R. S. Anderssen: A Refinement Procedure for Pure Random Search. 197-200
• Grzegorz Rozenberg: The Equivalence Problem for Deterministic T0L-Systems is Undecidable. 201-204 , Errata: Inf. Process. Lett. 1(6): 252(1972)
• I. N. Molchanov, N. I. Stepanets: Iterative Methods for Solving Difference Equations of the Theory of Elasticity not Depending on the Spacing of the Difference Set. 205-210
• G. B. Krepyshev, Ya. A. Pollack: Synthesis of a Discrete-Time Optimal Filter Algorithm with Reduced Sensitivity to Deviations of a Priori Statistics. 211-215
• Jaroslav Král: Errata: A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths. 216 , ->Jaroslav Král: A New Additive Pseudorandom Number Generator for Extremely Short Word-Lengths. Inf. Process. Lett. 1(4): 164-167(1972)
• Ellis Horowitz: Errata: A Fast Method for Interpolation Using Preconditioning. 216 , ->Inf. Process. Lett. 1(4): 157-163(1972)

Volume 1, Number 6, December 1972

• A. Brandstetter: Storage Requirements in Stochastic Data Acquisition Systems. 217-219
• Jürg Nievergelt, J. Pradels, C. K. Wong, P. C. Yue: Bounds on the Weighted Path Length of Binary Trees. 220-225
• Rudolf Bayer: Oriented Balanced Trees and Equivalence Relations. 226-228
• Joost Engelfriet: A Note on Infinite Trees. 229-232
• Grzegorz Rozenberg: Direct Proofs of the Undecidability of the Equivalence Problem for Sentential Forms of Linear Context-Free Grammars and the Equivalence Problem for 0L Systems. 233-235
• Spyros G. Tzafestas: Design Parameters for a Multiserver Processing Buffering System with Feedback. 236-243
• John L. Baker: An Unintentional Omission from ALGOL 68. 244-245
• Raj Reddy, W. Broadley, Lee D. Erman, R. Johnsson, J. Newcomer, George G. Robertson, J. Wright: XCRIBL - A Hardcopy Scan Line Graphics System for Document Generation. 246-251
• Grzegorz Rozenberg: Errata: The Equivalence Problem for Deterministic T0L-Systems is Undecidable. 252 , ->Inf. Process. Lett. 1(5): 201-204(1972)