| 181 | -- | 186 | Zhaofang Wen. Parallel Multiple Search |
| 187 | -- | 191 | David Pokrass Jacobs. Probabilistic Checking of Associativity in Algebras |
| 193 | -- | 196 | Xiaotie Deng, Sanjeev Mahajan. Server Problems and Resistive Spaces |
| 197 | -- | 200 | Robert W. Irving. On Approximating the Minimum Independent Dominating Set |
| 201 | -- | 204 | Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki. The Intersection Searching Problem for c-Oriented Polygons |
| 205 | -- | 213 | Cornelis Huizing, Willem P. de Roever. Introduction to Design Choices in the Semantics of Statecharts |
| 215 | -- | 217 | Uri Zwick. An Extension of Khrapchenko s Theorem |
| 219 | -- | 224 | Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan. A New Approach for the Domination Problem on Permutation Graphs |
| 225 | -- | 231 | Peter F. Corbett, Isaac D. Scherson. A Unified Algorithm for Sorting on Multidimensional Mesh-Connected Processors |
| 233 | -- | 236 | Maria J. Serna. Approximating Linear Programming is Log-Space Complete for P |
| 237 | -- | 240 | Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul. Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n) |