| 195 | -- | 199 | Henry W. Davis. Cost-Error Relationships in A* Tree-Searching |
| 200 | -- | 212 | Bernard Chazelle. Lower Bounds for Orthogonal Range Searching: I. The Reporting Case |
| 213 | -- | 223 | Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert Endre Tarjan. Faster Algorithms for the Shortest Path Problem |
| 224 | -- | 237 | Béla Bollobás, Andrei Z. Broder, István Simon. The Cost Distribution of Clustering in Random Probing |
| 238 | -- | 256 | Baruch Awerbuch, Oded Goldreich, David Peleg, Ronen Vainish. A Trade-Off between Information and Communication in Broadcast Protocols |
| 257 | -- | 278 | Maurice Herlihy. Concurrency and Availability as Dual Properties of Replicated Atomic Data |
| 279 | -- | 317 | Martín Abadi, Zohar Manna. Nonclausal Deduction in First-Order Temporal Logic |
| 318 | -- | 334 | Farhad Shahrokhi, David W. Matula. The Maximum Concurrent Flow Problem |
| 335 | -- | 372 | Jan A. Bergstra, Jan Heering, Paul Klint. Module Algebra |
| 373 | -- | 414 | François Baccelli, Zhen Liu. On the Execution of Parallel Programs on Multiprocessor Systems-A Queuing Theory Approach |
| 415 | -- | 438 | Ker-I Ko. Separating and Collapsing Results on the Relativized Probabilistic Polynomial-Time Hierarchy |