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