| 991 | -- | 1018 | Edward G. Coffman Jr., M. R. Garey. Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling |
| 1019 | -- | 1047 | Zhi-Quan Luo, John N. Tsitsiklis. On the Communication Complexity of Distributed Algebraic Computation |
| 1048 | -- | 1066 | Bruce Randall Donald, Patrick G. Xavier, John F. Canny, John H. Reif. Kinodynamic Motion Planning |
| 1067 | -- | 1086 | Y. C. Tay. On the Optimality of Strategies for Multiple Joins |
| 1087 | -- | 1107 | Alan Fekete, Nancy A. Lynch, Yishay Mansour, John Spinelli. The Impossibility of Implementing Reliable Communication in the Face of Crashes |
| 1108 | -- | 1133 | Martin Charles Golumbic, Ron Shamir. Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach |
| 1134 | -- | 1164 | Stefan Arnborg, Bruno Courcelle, Andrzej Proskurowski, Detlef Seese. An Algebraic Theory of Graph Reduction |
| 1165 | -- | 1187 | Jean Fonlupt, Armand Nachef. Dynamic Programming and the Graphical Traveling Salesman Problem |
| 1188 | -- | 1208 | Alain Jean-Marie, Levent Gün. Parallel Queues with Resequencing |
| 1209 | -- | 1237 | François Baccelli, Zhen Liu, Donald F. Towsley. Extremal Scheduling of Parallel Processing with and without Real-Time Constraints |
| 1238 | -- | 1301 | Charles Knessl. On the Sojourn Time Distribution in a Finite Capacity Processor Shared Queue |