1. Editor’s Note

   Acknowledgments 22 January 2014 Pages: 149 - 149

2. On Equilibria in Quantitative Games with Reachability/Safety Objectives

   • Thomas Brihaye
   • Véronique Bruyère
   • Julie De Pril

   OriginalPaper 28 August 2013 Pages: 150 - 189

   

3. Prehistoric Graph in Modal Derivations and Self-Referentiality

   • Junhua Yu

   OriginalPaper 07 December 2013 Pages: 190 - 210

4. Approximating the Minimum Length of Synchronizing Words Is Hard

   • Mikhail V. Berlinkov

   OriginalPaper 13 November 2013 Pages: 211 - 223

   

5. Growth of Power-Free Languages over Large Alphabets

   • Arseny M. Shur

   OriginalPaper 14 November 2013 Pages: 224 - 243

   

6. Obtaining Online Ecological Colourings by Generalizing First-Fit

   • Matthew Johnson
   • Viresh Patel
   • Théophile Trunck

   OriginalPaper 07 December 2013 Pages: 244 - 260

   

7. Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms

   • Dmitry Itsykson

   OriginalPaper 14 November 2013 Pages: 261 - 276

8. Quotient Complexity of Closed Languages

   • Janusz Brzozowski
   • Galina Jirásková
   • Chenglong Zou

   OriginalPaper 19 November 2013 Pages: 277 - 292

   

9. Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata

   • Pavel Martyugin

   OriginalPaper 14 November 2013 Pages: 293 - 304

   

10. Encoding Invariance in Average Case Complexity

    • Nikolay Vereshchagin

    OriginalPaper 26 November 2013 Pages: 305 - 317

11. Balancing Bounded Treewidth Circuits

    • Maurice Jansen
    • Jayalal Sarma

    OriginalPaper 01 December 2013 Pages: 318 - 336

    

12. Validating the Knuth-Morris-Pratt Failure Function, Fast and Online

    • Paweł Gawrychowski
    • Artur Jeż
    • Łukasz Jeż

    OriginalPaper Open access 06 December 2013 Pages: 337 - 372