1. Preface

   • Sergei Artemov
   • Volker Diekert
   • Dima Grigoriev

   EditorialNotes 02 December 2008 Pages: 1 - 1

2. Generic Complexity of Presburger Arithmetic

   • Alexander N. Rybalov

   OriginalPaper 28 May 2008 Pages: 2 - 8

3. On the Complexity of Matrix Rank and Rigidity

   • Meena Mahajan
   • Jayalal M. N. Sarma

   OriginalPaper 06 August 2008 Pages: 9 - 26

4. Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

   • Artur Jeż
   • Alexander Okhotin

   OriginalPaper 21 August 2008 Pages: 27 - 58

5. A Fast Algorithm for the Path 2-Packing Problem

   • Maxim A. Babenko

   OriginalPaper 15 August 2008 Pages: 59 - 79

6. Equivalence Problems for Circuits over Sets of Natural Numbers

   • Christian Glaßer
   • Katrin Herr
   • Matthias Waldherr

   OriginalPaper 08 September 2008 Pages: 80 - 103

7. Maximal Intersection Queries in Randomized Input Models

   • Benjamin Hoffmann
   • Mikhail Lifshits
   • Dirk Nowotka

   OriginalPaper 30 October 2008 Pages: 104 - 119

8. Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing

   • Qi Cheng
   • Sergey P. Tarasov
   • Mikhail N. Vyalyi

   OriginalPaper 18 November 2008 Pages: 120 - 142

9. Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?

   • Harry Buhrman
   • Lance Fortnow
   • Nikolay Vereshchagin

   OriginalPaper Open access 17 December 2008 Pages: 143 - 156