| 164 | -- | 181 | Eric Allender, Klaus Reinhardt, Shiyu Zhou. Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds |
| 182 | -- | 194 | Harry Buhrman, Lance Fortnow. Two Queries |
| 195 | -- | 220 | Amos Beimel, Anna Gál. On Arithmetic Branching Programs |
| 221 | -- | 239 | Jin-yi Cai, Ajay Nerurkar. Approximating the SVP to within a Factor (1+1/dim:::xi:::) Is NP-Hard under Randomized Reductions |
| 240 | -- | 252 | Lance Fortnow, John D. Rogers. Complexity Limitations on Quantum Computation |
| 253 | -- | 269 | Oded Goldreich, Madhu Sudan. Computational Indistinguishability: A Sample Hierarchy |
| 270 | -- | 280 | D. Sivakumar. On Membership Comparable Sets |
| 327 | -- | 345 | Harry Buhrman, Dieter van Melkebeek. Hard Sets Are Hard to Find |
| 346 | -- | 372 | Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin. Arthur-Merlin Games in Boolean Decision Trees |