| 267 | -- | 269 | Fernando Ferreira, Benedikt Löwe, Elvira Mayordomo. Programs, Proofs, Processes |
| 270 | -- | 281 | Guillaume Blin, Romeo Rizzi, Stéphane Vialette. A Faster Algorithm for Finding Minimum Tucker Submatrices |
| 282 | -- | 296 | Eric Allender, Holger Spakowski. Avoiding Simplicity is Complex |
| 297 | -- | 312 | Rahul Santhanam. The Complexity of Explicit Constructions |
| 313 | -- | 329 | Ulrich Berger, Monika Seisenberger. Proofs, Programs, Processes |
| 330 | -- | 351 | Laurent Bienvenu, Frank Stephan, Jason Teutsch. How Powerful Are Integer-Valued Martingales? |
| 352 | -- | 371 | Douglas Cenzer, S. Ali Dashti, Ferit Toska, Sebastian Wyman. Computability of Countable Subshifts in One Dimension |
| 372 | -- | 400 | Jack H. Lutz, Brad Shutters. Approximate Self-Assembly of the Sierpinski Triangle |