| 1 | -- | 18 | Bonnie Berger, Peter W. Shor. Tight Bounds for the Maximum Acyclic Subgraph Problem |
| 19 | -- | 51 | Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen. A Reliable Randomized Algorithm for the Closest-Pair Problem |
| 52 | -- | 66 | Michel Habib, Lhouari Nourine, George Steiner. Gray Codes for the Ideals of Interval Orders |
| 67 | -- | 94 | Mohammad Hossain Heydari, Ivan Hal Sudborough. On the Diameter of the Pancake Network |
| 95 | -- | 117 | Yehuda Afek, Gideon Stupp. Optimal Time-Space Tradeoff for Shared Memory Leader Election |
| 118 | -- | 143 | Michael Krivelevich. Approximate Set Covering in Uniform Hypergraphs |
| 144 | -- | 161 | Michel Barbeau, Froduald Kabanza, Richard St.-Denis. An Efficient Algorithm for Controller Synthesis under Full Observation |
| 162 | -- | 176 | Noga Alon, Dmitry N. Kozlov. Coins with Arbitrary Weights |
| 177 | -- | 193 | Binay K. Bhattacharya, Sandeep Sen. On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm |
| 194 | -- | 202 | Andrew Chi-Chih Yao, Frances F. Yao. Dictionary Look-Up with One Error |