| 97 | -- | 122 | John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo. Scaled dimension and nonuniform complexity |
| 123 | -- | 165 | John Case, Sanjay Jain, Frank Stephan, Rolf Wiehagen. Robust learning--rich and poor |
| 166 | -- | 195 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors |
| 196 | -- | 234 | Deepak Chawla, Lin Li, Stephen Scott. On approximating weighted sums with exponentially many terms |
| 235 | -- | 243 | Boris Alexeev. Minimal DFA for testing divisibility |
| 244 | -- | 258 | Howard Barnum, Michael E. Saks. A lower bound on the quantum query complexity of read-once functions |
| 259 | -- | 280 | Carsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack. On relations between counting communication complexity classes |
| 281 | -- | 302 | Andrew Lomonosov, Meera Sitharam, Kihong Park. Network QoS games: stability vs optimality tradeoff |