| 1 | -- | 0 | Sergei N. Artëmov, Volker Diekert, Dima Grigoriev. Preface |
| 2 | -- | 8 | Alexander Rybalov. Generic Complexity of Presburger Arithmetic |
| 9 | -- | 26 | Meena Mahajan, Jayalal M. N. Sarma. On the Complexity of Matrix Rank and Rigidity |
| 27 | -- | 58 | Artur Jez, Alexander Okhotin. Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth |
| 59 | -- | 79 | Maxim A. Babenko. A Fast Algorithm for the Path 2-Packing Problem |
| 80 | -- | 103 | Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr. Equivalence Problems for Circuits over Sets of Natural Numbers |
| 104 | -- | 119 | Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits, Dirk Nowotka. Maximal Intersection Queries in Randomized Input Models |
| 120 | -- | 142 | Qi Cheng, Sergey P. Tarasov, Mikhail N. Vyalyi. Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing |
| 143 | -- | 156 | Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin. Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? |