Journal: Inf. Process. Lett.

Volume 13, Issue 4/5

131 -- 133Christos H. Papadimitriou, Mihalis Yannakakis. The Clique Problem for Planar Graphs
134 -- 137Gerhard Barth. An Alternative for the Implementation of the Knuth-Morris-Pratt Algorithm
138 -- 141R. H. Davis, C. Rinaldi, C. J. Trebilcock. Data Compression in Limited Capacity Microcomputer Systems
142 -- 144Wojciech Rytter. Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata
145 -- 146Wojciech Rytter. A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata
147 -- 153Viktor K. Sabelfeld. Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable
154 -- 156Nathan Goodman, Oded Shmueli. Limitations of the Chase
157 -- 159Alan A. Bertossi. The Edge Hamiltonian Path Problem is NP-Complete
160 -- 163Laurent Siklóssy. Efficient Query Evaluation in Relational Data Bases with Missing Values
164 -- 167Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis. The Complexity of Testing Whether a Graph is a Superconcentrator
168 -- 170Jacob T. Schwartz. Finding the Minimum Distance Between Two Convex Polygons
171 -- 176Massimo Ancona, Vittoria Gianuzzi. A New Method for Implementing LR(k) Tables
177 -- 181Herbert Edelsbrunner, Hermann A. Maurer. On the Intersection of Orthogonal Objects
182 -- 186Akira Nakamura, Kunio Aizawa. Acceptors for Isometric Parallel Context-Free Array Languages
187 -- 190M. Howard Williams. A Systematic Test for Extended Operator Precedence
191 -- 194Hiroto Yasuura. Width and Depth of Combinational Logic Circuits
195 -- 198Rusins Freivalds. Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata
199 -- 203R. K. Arora, N. K. Sharma. Guarded Procedure: A Distributed Programming Concept
204 -- 214Giovanni Guida, Marco Somalvico. Multi-Problem-Solving: Knowledge Representation and System Architecture
215 -- 217Henry S. Warren Jr., A. Shawhan Fox, Peter W. Markstein. Modulus Division on a Two s Complement Machine
218 -- 220José M. Troya, A. Vaquero. An Approximation Algorithm for Reducing Expected Head Movement in Linear Storage Devices

Volume 13, Issue 3

89 -- 93Oscar H. Ibarra, Louis E. Rosier. On the Decidability of Equivalence for Deterministic Pushdown Transducers
94 -- 97Hideki Yamasaki. On Weak Persistency of Petri Nets
98 -- 102Tat-hung Chan. Deciding Freeness for Program Schemes with a Single Unary Function
103 -- 106R. H. Barlow, D. J. Evans, J. Shanehchi. A Parallel Merging Algorithm
107 -- 0Refael Hassin. Maximum Flow in (s, t) Planar Networks
108 -- 113Andrzej Ehrenfeucht, Grzegorz Rozenberg. On the Subword Complexity of D0L Languages with a Constant Distribution
114 -- 117Richard S. Bird. The Jogger s Problem
118 -- 119M. D. Atkinson. The Cyclic Towers of Hanoi
120 -- 124Donald MacDavid Tolle, William E. Siddall. On the Complexity of Vector Computations in Binary Tree Machines
125 -- 126Dorothy E. Denning, Henk Meijer, Fred B. Schneider. More on Master Keys for Group Sharing
127 -- 130Jan L. A. van de Snepscheut. Synchronous Communication Between Asynchronous Components

Volume 13, Issue 2

45 -- 47Mireille Clerbout, Michel Latteux. The Inclusion of D0L in MULTI-RESET
48 -- 49O. M. Makarov. Using Duality for the Synthesis of an Optimal Algorithm Involving Matrix Multiplication
50 -- 54Robert Hood, Robert Melville. Real-Time Queue Operation in Pure LISP
55 -- 57Mikhail J. Atallah, S. Rao Kosaraju. An Adversary-Based Lower Bound for Sorting
58 -- 63Wojciech Rytter. The Dynamic Simulation of Recursive and Stack Manipulation Programs
64 -- 66Mireille Régnier. On the Average Height of Trees in Digital Search and Dynamic Hashing
67 -- 70Ysmar V. Silva Filho. Optimal Choice of Discriminators in a Balanced k-d Binary Search Tree
71 -- 72Victor Y. Pan. The Lower Bounds on the Additive Complexity of Bilinear Problems in Terms of Some Algebraic Quantities
73 -- 76Ronald V. Book. NTS Grammars and Church-Rosser Systems
77 -- 79Jeffrey Scott Vitter. A Shared-Memory Scheme for Coalesced Hashing
80 -- 84Akira Nakamura. Some Remarks on One-Pebble Rectangular Array Acceptors
85 -- 86Shlomo Moran. A Note on Is Shortest Path Problem not Harder Than Matrix Multiplication?
87 -- 0Francesco Romani. Author s Reply to S. Moran s Note on the Shortest Path Problem

Volume 13, Issue 1

1 -- 3Osamu Watanabe. A Fast Algorithm for Finding all Shortest Paths
4 -- 7Gilbert N. Lewis, Nancy J. Boynton, F. Warren Burton. Expected Complexity of Fast Search with Uniformly Distributed Data
8 -- 11James A. Storer. Constructing Full Spanning Trees for Cubic Graphs
12 -- 15Oscar H. Ibarra, Shlomo Moran. Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication
16 -- 19James F. Korsh. Greedy Binary Search Trees are Nearly Optimal
20 -- 22Ashok K. Agrawala, Satish K. Tripathi. On the Optimality of Semidynamic Routing Schemes
23 -- 29Kotagiri Ramamohanarao, Ron Sacks-Davis. Hardware Address Translation for Machines with a Large Virtual Memory
30 -- 34Géraud Sénizergues. A New Class of C.F.L. for Which the Equivalence is Decidable
35 -- 38Hamish I. E. Gunn, David M. Harland. Degrees of Constancy in Programming Languages
39 -- 43Yu. G. Stoyan, S. V. Smelyakov. An Approach to the Problems of Routing Optimization in the Regions of Intricate Shape