| 237 | -- | 0 | Sampath Kannan, Mihalis Yannakakis. Guest Editors foreword |
| 238 | -- | 268 | Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy. A sharp threshold in proof complexity yields lower bounds for satisfiability search |
| 269 | -- | 284 | Bernard Chazelle, Ding Liu. Lower bounds for intersection searching and fractional cascading in higher dimension |
| 285 | -- | 302 | Martin Grohe. Computing crossing numbers in quadratic time |
| 303 | -- | 318 | Adam R. Klivans, Rocco A. Servedio. Learning DNF in time 2:::Õ(n:::1/3:::)::: |
| 319 | -- | 334 | Marcus Schaefer, Daniel Stefankovic. Decidability of string graphs |
| 335 | -- | 373 | John Dunagan, Santosh Vempala. Optimal outlier removal in high-dimensional spaces |
| 374 | -- | 397 | Luca de Alfaro, Rupak Majumdar. Quantitative solution of omega-regular games |
| 398 | -- | 416 | Andris Ambainis. A new protocol and lower bounds for quantum coin flipping |
| 417 | -- | 441 | Moses Charikar, Rina Panigrahy. Clustering to minimize the sum of cluster diameters |
| 442 | -- | 470 | Michel X. Goemans, David P. Williamson. Approximation algorithms for M::AX::-3-C::UT:: and other problems via complex semidefinite programming |