| 1 | -- | 2 | Jin-yi Cai, Alan L. Selman. Foreword |
| 3 | -- | 13 | Manindra Agrawal. The isomorphism conjecture for constant depth reductions |
| 14 | -- | 40 | Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy. The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory |
| 41 | -- | 61 | Jin-yi Cai, Pinyan Lu. Holographic algorithms: From art to science |
| 62 | -- | 90 | Chandan K. Dubey, Uriel Feige, Walter Unger. Hardness results for approximating the bandwidth |
| 91 | -- | 106 | Lance Fortnow, Rahul Santhanam. Infeasibility of instance compression and succinct PCPs for NP |
| 107 | -- | 121 | Parikshit Gopalan, Venkatesan Guruswami. Hardness amplification within NP against deterministic algorithms |
| 122 | -- | 128 | Richard M. Karp. Heuristic algorithms in computational molecular biology |
| 129 | -- | 141 | Subhash Khot, Rishi Saket. On the hardness of learning intersections of two halfspaces |
| 142 | -- | 153 | David Buchfuhrer, Christopher Umans. The complexity of Boolean formula minimization |
| 154 | -- | 166 | Leslie G. Valiant. A bridging model for multi-core computing |
| 167 | -- | 190 | Ran Raz, Amir Yehudayoff. Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors |
| 191 | -- | 220 | Jesse Kamp, Anup Rao, Salil P. Vadhan, David Zuckerman. Deterministic extractors for small-space sources |