| 147 | -- | 0 | Pavel Pudlák. Gust Editor s Foreword |
| 148 | -- | 185 | Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet. The Communication Complexity of Enumeration, Elimination, and Selection |
| 186 | -- | 200 | David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie. On the Complexity of Some Problems on Groups Input as Multiplication Tables |
| 201 | -- | 221 | André Berthiaume, Wim van Dam, Sophie Laplante. Quantum Kolmogorov Complexity |
| 222 | -- | 235 | Oliver Giel. Branching Program Size Is Almost Linear in Formula Size |
| 236 | -- | 252 | Valentine Kabanets. Easiness Assumptions and Hardness Tests: Trading Time for Zero Error |
| 253 | -- | 267 | Ketan Mulmuley, Pradyut Shah. A Lower Bound for the Shortest Path Problem |
| 268 | -- | 287 | Iannis Tourlakis. Time-Space Tradeoffs for SAT on Nonuniform Machines |
| 288 | -- | 303 | Ke Yang. Integer Circuit Evaluation Is PSPACE-Complete |