| 215 | -- | 220 | Dror Lapidot, Adi Shamir. Fully Parallelized Multi-Prover Protocols for NEXP-Time |
| 221 | -- | 226 | Jaikumar Radhakrishnan. Better Lower Bounds for Monotone Threshold Formulas |
| 227 | -- | 242 | Donald B. Johnson, Panagiotis Takis Metaxas. Connected Components in O (log^3/2 n) Parallel Time for the CREW PRAM |
| 243 | -- | 254 | Zvi Galil, Oded Margalit. All Pairs Shortest Paths for Graphs with Small Integer Length Edges |
| 255 | -- | 262 | Noga Alon, Zvi Galil, Oded Margalit. On the Exponent of the All Pairs Shortest Path Problem |
| 265 | -- | 304 | Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton. Breaking the Theta (n log² n) Barrier for Sorting with Faults |
| 305 | -- | 316 | Uriel Feige. A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity |
| 317 | -- | 331 | Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations |
| 332 | -- | 344 | Charles E. Leiserson, Satish Rao, Sivan Toledo. Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers |
| 345 | -- | 370 | Amir M. Ben-Amram. When Can We Sort in o(n log n) Time? |
| 371 | -- | 380 | Avrim Blum, Ravindran Kannan. Learning an Intersection of a Constant Number of Halfspaces over a Uniform Distribution |