On Equilibria in Quantitative Games with Reachability/Safety Objectives Thomas BrihayeVéronique BruyèreJulie De Pril OriginalPaper 28 August 2013 Pages: 150 - 189
Prehistoric Graph in Modal Derivations and Self-Referentiality Junhua Yu OriginalPaper 07 December 2013 Pages: 190 - 210
Approximating the Minimum Length of Synchronizing Words Is Hard Mikhail V. Berlinkov OriginalPaper 13 November 2013 Pages: 211 - 223
Growth of Power-Free Languages over Large Alphabets Arseny M. Shur OriginalPaper 14 November 2013 Pages: 224 - 243
Obtaining Online Ecological Colourings by Generalizing First-Fit Matthew JohnsonViresh PatelThéophile Trunck OriginalPaper 07 December 2013 Pages: 244 - 260
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
Quotient Complexity of Closed Languages Janusz BrzozowskiGalina JiráskováChenglong Zou OriginalPaper 19 November 2013 Pages: 277 - 292
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
Encoding Invariance in Average Case Complexity Nikolay Vereshchagin OriginalPaper 26 November 2013 Pages: 305 - 317
Balancing Bounded Treewidth Circuits Maurice JansenJayalal Sarma OriginalPaper 01 December 2013 Pages: 318 - 336
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online Paweł GawrychowskiArtur JeżŁukasz Jeż OriginalPaper Open access 06 December 2013 Pages: 337 - 372