| 30 | -- | 0 | Victor Vianu. Editorial: JACM redux |
| 31 | -- | 0 | Ho Yee Cheung, Tsz Chiu Kwok, Lap Chi Lau. Fast matrix rank algorithms and applications |
| 32 | -- | 0 | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Colin McQuillan. The expressibility of functions on the boolean domain, with applications to counting CSPs |
| 33 | -- | 0 | Nitin Saxena, C. Seshadhri. From sylvester-gallai configurations to rank bounds: Improved blackbox identity test for depth-3 circuits |
| 34 | -- | 0 | Andrei A. Bulatov. The complexity of the counting constraint satisfaction problem |
| 35 | -- | 0 | Pierre Fraigniaud, Amos Korman, David Peleg. Towards a complexity theory for local distributed computing |
| 36 | -- | 0 | Zdenek Dvorak, Daniel Král, Robin Thomas. Testing first-order properties for subclasses of sparse graphs |
| 37 | -- | 0 | Phokion G. Kolaitis, Swastik Kopparty. Random graphs and the parity quantifier |
| 38 | -- | 0 | Victor Vianu. Invited article foreword |
| 39 | -- | 0 | Mika Göös, Juho Hirvonen, Jukka Suomela. Lower bounds for local approximation |