| 305 | -- | 0 | Sanjeev Khanna, Aravind Srinivasan. Special issue: 35th Annual ACM Symposium on Theory of Computing |
| 306 | -- | 329 | René Beier, Berthold Vöcking. Random knapsack in expected polynomial time |
| 330 | -- | 353 | Mikkel Thorup. Integer priority queues with decrease key in constant time and the single source shortest paths problem |
| 354 | -- | 382 | Noga Alon, Asaf Shapira. Testing subgraphs in directed graphs |
| 383 | -- | 394 | Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke. Optimal oblivious routing in polynomial time |
| 395 | -- | 420 | Iordanis Kerenidis, Ronald de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument |
| 421 | -- | 434 | Elchanan Mossel, Ryan O Donnell, Rocco A. Servedio. Learning functions of k relevant variables |
| 435 | -- | 447 | T. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani. Cell-probe lower bounds for the partial match problem |
| 448 | -- | 484 | Leonid Gurvits. Classical complexity and quantum entanglement |
| 485 | -- | 497 | Jittat Fakcharoenphol, Satish Rao, Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics |