Journal: Inf. Process. Lett.

Volume 10, Issue 4/5

169 -- 172Robert Melville, David Gries. Controlled Density Sorting
173 -- 177Alan A. Bertossi. On the Complexity of Scheduling Jobs on Dedicated Resources to Minimize Set-Up Costs
178 -- 179Aviezri S. Fraenkel, Yaacov Yesha. Complexity of Solving Algebraic Equations
180 -- 183Fabrizio Luccio, S. Mazzone. A Cryptosystem for Multiple Communication
184 -- 188Thomas Lengauer, Robert Endre Tarjan. The Space Complexity of Pebble Games on Trees
189 -- 192Arthur M. Farley. Levelling Terrain Trees: A Transshipment Problem
193 -- 197Manfred Broy, Martin Wirsing. Program Development: From Enumeration to Backtracking
198 -- 201F. Warren Burton, Gilbert N. Lewis. A Robust Variation of Interpolation Search
202 -- 205Carla D. Savage. Maximum Matchings and Trees
206 -- 208R. W. Doran, L. K. Thomas. Variants of the Software Solution to Mutual Exclusion
209 -- 212Mark H. Overmars, Jan van Leeuwen. Further Comments on Bykat s Convex Hull Algorithm
213 -- 218Henk Meijer, Selim G. Akl. The Design and Analysis of a New Hybrid Sorting Algorithm
219 -- 222Akira Nakamura, Katsushi Inoue. A Remark on Two-Dimensional Finite Automata
223 -- 225Andrzej Ehrenfeucht, Grzegorz Rozenberg. On the Emptiness of the Intersection of Two D0S Languages Problem
226 -- 230Kin-Man Chung, Fabrizio Luccio, C. K. Wong. A New Permutation Algorithm for Bubble Memories
231 -- 233Corrado Böhm, Antonio Machi, Giovanna Sontacchi. Complexity Bounds for Equivalence and Isomorphism of Latin Squares
234 -- 239Ludwik Czaja. Deadlock and Fairness in Parallel Schemas: A Set-Theoretic Characterization and Decision Problems
240 -- 242Kellogg S. Booth. Lexicographically Least Circular Substrings
243 -- 244Peter Buneman, Leon S. Levy. The Towers of Hanoi Problem
245 -- 248Katsushi Inoue, Itsuo Takanami. A Note on Decision Problems for Three-Way Two-Dimensional Finite Automata

Volume 10, Issue 3

111 -- 115R. K. Arora, S. P. Rana. Analysis of the Module Assignment Problem in Distributed Computing Systems with Limited Storage
116 -- 119Osamu Watanabe. Another Application of Recursion Introduction
120 -- 123Peter J. L. Wallis, Bernard W. Silverman. Efficient Implementation of the Ada Overloading Rules
124 -- 126C. Hemerik. Formal Derivation of a List Processing Program
127 -- 128David G. Kirkpatrick. A Note on Delaunay and Optimal Triangulations
129 -- 131Patrick Shen-Pei Wang. Some New Results on Isotonic Array Grammars
132 -- 136Peter van Emde Boas. On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination
137 -- 147Wojciech Cellary. A Simple Model of Query Scheduling in Distributed Data Base Systems
148 -- 152John A. Barnden. A Characterization of Systems Derived From Terminating Concurrent Histories
153 -- 158Ludwik Czaja. Parallel System Schemas and Their Relation to Automata
159 -- 162Joep L. W. Kessels. The Readers and Writers Problem Avoided
163 -- 167M. van der Nat. A Fast Sorting Algorithm, a Hybrid of Distributive and Merge Sorting
168 -- 0Selim G. Akl. Corrigendum on Convex Hull Algorithms

Volume 10, Issue 2

47 -- 50Bruce Anderson. Encoded pointers - An Interesting DataSstructure for Modern Sil s
51 -- 56Jan van Leeuwen, Derick Wood. Dynamization of Decomposable Searching Problems
57 -- 62Viktor K. Sabelfeld. The Logic-Termal Equivalence is Polynomial-Time Decidable
63 -- 67Solomon Passy. Structured Programs for Turing Machines
68 -- 75Thomas C. Wilson, Joseph Shortt. An O(log n) Algorithm for Computing General Order-k Fibonacci Numbers
76 -- 79Frank M. Liang. A Lower Bound for On-Line Bin Packing
80 -- 82Manuel Blum, Ashok K. Chandra, Mark N. Wegman. Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time
83 -- 86Paul M. B. Vitányi. Achievable High Scores of epsilon-Moves and Running Times in DPDA Computations
87 -- 88Nicola Santoro. Extending the Four Russians Bound to General Matrix Multiplication
89 -- 95Hanan Samet, Leo Marcus. Purging in an Equality Data Base
96 -- 98Mordechai Ben-Ari. A Simplified Proof That Regular Resolution is Exponential
99 -- 103Alexandre Brandwajn, René Joly. A Scheme for Fault-Tolerant Virtual Memory
104 -- 107Frank G. Pagan. On the Generation of Compilers from Language Definitions
108 -- 110Mehdi Jazayeri. An Improvement in the Iterative Data Flow Analysis Algorithm

Volume 10, Issue 1

1 -- 3Michael J. C. Gordon. The Denotational Semantics of Sequential Machines
4 -- 8H. Olivie. On the Relationship Between SonTtrees and Symmetric Binary B-Trees
9 -- 13Victor J. Rayward-Smith, R. N. Rolph. Finding Linear and Circular Sequences of Minimal and Maximal Total Adjacency
14 -- 19Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis. Testing the Universal Instance Assumption
20 -- 0Ashoke Deb. Conflict-Free Access of Arrays - A Counter Example
21 -- 24Miroslaw Truszczynski. Once More on Storage for Consecutive Retrieval
25 -- 27Leslie M. Goldschlager. A Space Efficient Algorithm for the Monotone Planar Circuit Value Problem
28 -- 31Errol L. Lloyd. List Scheduling Bounds for UET Systems With Resources
32 -- 34Carlo Zaniolo. Mixed Transitivity for Functional and Multivalued Dependencies in Database Relations
35 -- 36Thang Nguyen Bui. A Note on an Improved Bisection Algorithm
37 -- 40Daniel Dominic Sleator. A 2.5 Times Optimal Algorithm for Packing in Two Dimensions
41 -- 45Dilip V. Sarwate. A Note on Universal Classes of Hash Functions