| 1 | -- | 42 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor. The Power of Unentanglement |
| 43 | -- | 67 | Tal Moran, Moni Naor, Gil Segev. Deterministic History-Independent Strategies for Storing Information on Write-Once Memories |
| 69 | -- | 82 | Shachar Lovett. Unconditional Pseudorandom Generators for Low Degree Polynomials |
| 83 | -- | 117 | Subhash Khot, Ryan O Donnell. SDP Gaps and UGC-hardness for Max-Cut-Gain |
| 119 | -- | 123 | Andrew M. Childs, Richard Cleve, Stephen P. Jordan, David L. Yonge-Mallo. Discrete-Query Quantum Algorithm for NAND Trees |
| 125 | -- | 134 | Ilan Newman, Yuri Rabinovich. Hard Metrics from Cayley Graphs of Abelian Groups |
| 135 | -- | 140 | Lance Fortnow. A Simple Proof of Toda s Theorem |
| 141 | -- | 172 | Thomas Holenstein. Parallel Repetition: Simplification and the No-Signaling Case |
| 173 | -- | 189 | Virginia Vassilevska, Ryan Williams, Raphael Yuster. All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time |
| 191 | -- | 216 | Dana Glasner, Rocco A. Servedio. Distribution-Free Testing Lower Bound for Basic Boolean Functions |
| 217 | -- | 238 | John Watrous. Semidefinite Programs for Completely Bounded Norms |
| 239 | -- | 255 | Eli Ben-Sasson, Michael Viderman. Tensor Products of Weakly Smooth Codes are Robust |
| 257 | -- | 282 | Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee. Optimal Cryptographic Hardness of Learning Monotone Functions |