| 211 | -- | 0 | John H. Reif. Guest Editor s Foreword |
| 212 | -- | 243 | Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski. Random sampling and approximation of MAX-CSPs |
| 244 | -- | 262 | Saugata Basu. Computing the Betti numbers of arrangements via spectral sequences |
| 263 | -- | 290 | Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair. Clifford algebras and approximating the permanent |
| 291 | -- | 310 | Mary Cryan, Martin E. Dyer. A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant |
| 311 | -- | 324 | Xiaotie Deng, Christos H. Papadimitriou, Shmuel Safra. On the complexity of price equilibria |
| 325 | -- | 340 | Sanjeev Arora, Subhash Khot. Fitting algebraic curves to noisy data |
| 341 | -- | 364 | Tim Roughgarden. The price of anarchy is independent of the network topology |
| 365 | -- | 380 | Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic. Recognizing string graphs in NP |
| 381 | -- | 418 | Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas. Optimal finger search trees in the pointer machine |
| 419 | -- | 440 | Christopher Umans. Pseudo-random generators for all hardnesses |
| 441 | -- | 471 | Dimitris Achlioptas, Cristopher Moore. Almost all graphs with average degree 4 are 3-colorable |