| 3 | -- | 19 | Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi. The Relative Complexity of NP Search Problems |
| 20 | -- | 36 | Persi Diaconis, Laurent Saloff-Coste. What Do We Know about the Metropolis Algorithm? |
| 37 | -- | 49 | Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson. On Data Structures and Asymmetric Communication Complexity |
| 50 | -- | 66 | Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motwani, Prabhakar Raghavan. Randomized Query Processing in Robot Path Planning |
| 61 | -- | 73 | Jon M. Kleinberg, Éva Tardos. Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks |
| 74 | -- | 93 | Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman. Sorting in Linear Time? |
| 94 | -- | 124 | Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, Pravin Varaiya. What s Decidable about Hybrid Automata? |