Journal: Inf. Process. Lett.

Volume 14, Issue 5

197 -- 200Clelia de Felice. On the Triangle Conjecture
201 -- 204F. Warren Burton. A Linear Space Translation of Functional Programs to Turner Combinators
205 -- 206F. Warren Burton. An Efficient Functional Implementation of FIFO Queues
207 -- 0Anton Nijholt. A Note on the Sufficiency of Sokolowski s Criterion for Context-Free Languages
208 -- 213P. G. Reddy, Subhash Bhalla, Bandreddi E. Prasad. A Model of Concurrency Control in Distributed Database Systems
214 -- 217J. George Shanthikumar. A Recursive Algorithm to Generate Joint Probability Distribution of Arrivals from Exponential Sources During a Random Time Interval
218 -- 222Johnson M. Hart. Permutation Inversions and Multidimensional Cumulative Distribution Functions
223 -- 227David A. Carlson, John E. Savage. Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements
228 -- 232Reuven Bar-Yehuda, Uzi Vishkin. Complexity of Finding k-Path-Free Dominating Sets in Graphs
233 -- 237Carla D. Savage. Depth-First Search and the Vertex Cover Problem
236 -- 237Heinz Zemanek. Obituary: Victor Mikhaylovich Glushkov (1923-1982)

Volume 14, Issue 4

147 -- 149Matti Jakobsson. Evaluation of a Hierarchical Bit-Vector Compression Technique
150 -- 157Jack A. Orenstein. Multidimensional Tries Used for Associative Searching
158 -- 161Hiroshi Umeo, Kenichi Morita, Kazuhiro Sugata. Deterministic One-Way Simulation of Two-Way Real-Time Cellular Automata and Its Related Problems
162 -- 167Giordano Beretta. Monte Carlo Estimation of Numerical Stability in Fast Algorithms for Systems of Bilinear Forms
168 -- 173Paul Franchi-Zannettacci. An Extension to Trees of the Sardinas and Patterson Algorithm
174 -- 178Robert Demolombe. Generalized Division for Relational Algebraic Language
179 -- 182Ernst-Erich Doberkat. Asymptotic Estimates for the Higher Moments of the Expected Behavior of Straight Insertion Sort
183 -- 186Michael J. Fischer, Nancy A. Lynch. A Lower Bound for the Time to Assure Interactive Consistency
187 -- 190Jiann H. Jou, Patrick C. Fischer. The Complexity of Recognizing 3NF Relation Schemes
191 -- 194Jack Minker, Guy Zanon. An Extension to Linear Resolution with Selection Function

Volume 14, Issue 3

97 -- 100Takashi Yokomori, Derick Wood, Klaus-Jörn Lange. A Three-Restricted Normal Form Theorem for ET0L Languages
101 -- 103Jorma Tarhio. LR Parsing of Some Ambiguous Grammars
104 -- 108Dietmar Wätjen, Werner Struckmann. An Algorithm for Verifying Equations of Morphisms in a Category
109 -- 111K. N. King, Barbara Smith-Thomas. An Optimal Algorithm for Sink-Finding
112 -- 116Jean-Louis Lassez, V. L. Nguyen, Liz Sonenberg. Fixed Point Theorems and Semantics: A Folk Tale
117 -- 118R. H. Barlow, D. J. Evans, J. Shanehchi. Parallel Multisection for the Determination of the Eigenvalues of Symmetric Quindiagonal Matrices
119 -- 123Johannes Röhrich. A Hybrid of Quicksort with O(n log n) Worst Case Complexity
124 -- 127Herbert Edelsbrunner, Mark H. Overmars. On the Equivalence of Some Rectangle Problems
128 -- 131Calvin C. Elgot, Alan J. Perlis, Lawrence Snyder. A Syntax-Free Semantics for the APL Operators
132 -- 138Dzenan Ridjanovic, Michael L. Brodie. Defining Database Dynamics with Attribute Grammars
139 -- 143James F. Korsh. Growing Nearly Optimal Binary Search Trees
144 -- 145Dario Bini. Reply to the Paper The Numerical Instability of Bini s Algorithm

Volume 14, Issue 2

49 -- 51Luis Fariñas del Cerro. A Simple Deduction Method for Modal Logic
52 -- 56A. O. Slisenko. Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems
57 -- 62Marc H. Graham, Alberto O. Mendelzon. Strong Equivalence of Relational Wxpressions Under Dependencies
63 -- 66J. C. Lagarias, Donald E. Swartwout. Minimal Storage Representations for Binary Relations
67 -- 73Giuseppina C. Gini. The Automatic Synthesis of Iterative Programs
74 -- 79Herbert Edelsbrunner, Hermann A. Maurer, David G. Kirkpatrick. Polygonal Intersection Searching
80 -- 85Jan A. Bergstra, John-Jules Ch. Meyer. A Simple Transfer Lemma for Algebraic Specifications
86 -- 92Eli Upfal. Formal Correctness Proofs of a Nondeterministic Program
93 -- 96Ludek Kucera. Parallel Computation and Conflicts in Memory Access

Volume 14, Issue 1

1 -- 3Alfred Schmitt. On the Computational Power of the Floor Function
7 -- 11Dhruva Nath, S. N. Maheshwari. Parallel Algorithms for the Connected Components and Minimal Spanning Tree Problems
12 -- 14Andries E. Brouwer, Peter van Emde Boas. A Note on Master Keys for Group Sharing
15 -- 17Roland Carl Backhouse. Writing a Number as a Sum of Two Squares: A New Solution
18 -- 21Erol Gelenbe, Danièle Gardy. On the Size of Projections: I
22 -- 25Hamish I. E. Gunn. Compile Time Type Checking of Structure Field Accessing
26 -- 29Robert Endre Tarjan. A Hierarchical Clustering Algorithm Using Strong Components
30 -- 33Robert Endre Tarjan. Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees
34 -- 38Jan van Leeuwen, Maurice Nivat. Efficient Recognition of Rational Relations
39 -- 43Ker-I Ko. Some Observations on the Probabilistic Algorithms and NP-hard Problems
44 -- 48Shmuel Zaks. Generation and Ranking of k-ary Trees