| 1 | -- | 25 | Andris Ambainis. A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search |
| 27 | -- | 46 | Matthias Englert, Harald Räcke, Matthias Westermann. Reordering Buffers for General Metric Spaces |
| 47 | -- | 79 | Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma. Quantum Expanders: Motivation and Construction |
| 81 | -- | 84 | Homin K. Lee. Decision Trees and Influence: an Inductive Proof of the OSSS Inequality |
| 85 | -- | 112 | Dániel Marx. Can You Beat Treewidth? |
| 113 | -- | 134 | Navin Goyal, Michael Saks. Rounds vs. Queries Tradeoff in Noisy Computation |
| 135 | -- | 177 | Ran Raz. Elusive Functions and Lower Bounds for Arithmetic Circuits |
| 179 | -- | 199 | Avrim Blum, Eyal Even-Dar, Katrina Ligett. Routing Without Regret: On Convergence to Nash Equilibria of Regret-Minimizing Algorithms in Routing Games |
| 201 | -- | 225 | Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel. Separating Deterministic from Randomized Multiparty Communication Complexity |
| 227 | -- | 245 | Dmitry Gavinsky, Alexander A. Sherstov. A Separation of NP and coNP in Multiparty Communication Complexity |
| 247 | -- | 290 | Uriel Feige, Jan Vondrák. The Submodular Welfare Problem with Demand Queries |
| 291 | -- | 308 | Zeev Dvir, Avi Wigderson. Monotone Expanders: Constructions and Applications |