| 1 | -- | 23 | Amos Fiat, Jared Saia. Censorship Resistant Peer-to-Peer Networks |
| 25 | -- | 43 | Uriel Feige, Eran Ofek. Easily refutable subformulas of large random 3CNF formulas |
| 45 | -- | 60 | Ishay Haviv, Oded Regev, Amnon Ta-Shma. On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy |
| 61 | -- | 79 | Dominik Janzing, Pawel Wocjan. A Simple PromiseBQP-complete Matrix Problem |
| 81 | -- | 102 | Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart. An Exponential Separation between Regular and General Resolution |
| 103 | -- | 128 | David Zuckerman. Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number |
| 129 | -- | 157 | Scott Aaronson, Greg Kuperberg. Quantum Versus Classical Proofs and Advice |
| 159 | -- | 177 | Jirí Matousek, Petr Skovron. Removing Degeneracy May Require a Large Dimension Increase |
| 179 | -- | 195 | Maria-Florina Balcan, Avrim Blum. Approximation Algorithms and Online Mechanisms for Item Pricing |
| 197 | -- | 209 | Chandra Chekuri, Martin Pal. An O(log ::::n::::) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem |
| 211 | -- | 219 | Johan Håstad, Avi Wigderson. The Randomized Communication Complexity of Set Disjointness |
| 221 | -- | 238 | Alexander A. Razborov, Sergey Yekhanin. An Omega(::::n:::::::1/3:::) Lower Bound for Bilinear Group Based Private Information Retrieval |