Theory of Computing Systems gratefully acknowledges the editorial work of Farid Ablayev, Edward Hirsch, Ernst Mayr and Alexander Vasiliev on this special issue based upon extended papers from the Computer Science Symposium in Russia, 2010. The papers in this issue include:

  • On Equilibria in Quantitative Games with Reachability/Safety Objectives, Thomas Brihaye, Véronique Bruyère, Julie De Pril

  • Prehistoric Graph in Modal Derivations and Self-Referentiality, Junhua Yu

  • Approximating the Minimum Length of Synchronizing Words Is Hard, Mikhail V. Berlinkov

  • Growth of Power-Free Languages over Large Alphabets, Arseny M. Shur

  • Obtaining Online Ecological Colourings by Generalizing First-Fit, Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck

  • Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms, Dmitry Itsykson

  • Quotient Complexity of Closed Languages, Janusz Brzozowski, Galina Jirásková, Chenglong Zou

  • Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata, Pavel Martyugin

  • Encoding Invariance in Average Case Complexity, Nikolay Vereshchagin

  • Balancing Bounded Treewidth Circuits, Maurice Jansen, Jayalal Sarma

  • Validating the Knuth-Morris-Pratt Failure Function, Fast and Online, Paweł Gawrychowski, Artur Jeż, Łukasz Jeż