| 2012 | Two-Way Automata Making Choices Only at the Endmarkers. | Viliam Geffert, Bruno Guillon, Giovanni Pighizzini |
| 2012 | Learnability of Co-r.e. Classes. | Ziyuan Gao, Frank Stephan |
| 2012 | A Faster Grammar-Based Self-index. | Travis Gagie, Pawel Gawrychowski, Juha Krkkinen, Yakov Nekrich, Simon J. Puglisi |
| 2012 | Advice Complexity of Online Coloring for Paths. | Michal Forisek, Lucia Keller, Monika Steinov |
| 2012 | Conservative Groupoids Recognize Only Regular Languages. | Danny Dub, Mario Latendresse, Pascal Tesson |
| 2012 | A Parameterized Complexity Tutorial. | Rod Downey |
| 2012 | Around the Physical Church-Turing Thesis: Cellular Automata, Formal Languages, and the Principles of Quantum Theory. | Gilles Dowek |
| 2012 | Computational Complexity of Rule Distributions of Non-uniform Cellular Automata. | Alberto Dennunzio, Enrico Formenti, Julien Provillard |
| 2012 | Catalytic Petri Nets Are Turing Complete. | Gabriel Ciobanu, G. Michele Pinna |
| 2012 | Approximate Regular Expressions and Their Derivatives. | Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot |
| 2012 | Covering Space in the Besicovitch Topology. | Julien Cervelle |
| 2012 | Strong Termination for Gap-Order Constraint Abstractions of Counter Systems. | Laura Bozzelli |
| 2012 | An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings. | Beate Bollig, Tobias Prger |
| 2012 | Automata-Based Symbolic Representations of Polyhedra. | Bernard Boigelot, Julien Brusten, Jean-Franois Degbomont |
| 2012 | Fast and Cache-Oblivious Dynamic Programming with Local Dependencies. | Philip Bille, Morten Stckel |
| 2012 | Longest Common Extensions via Fingerprinting. | Philip Bille, Inge Li Grtz, Jesper Kristensen |
| 2012 | Defining Contexts in Context-Free Grammars. | Mikhail Barash, Alexander Okhotin |
| 2012 | Reversible Multi-head Finite Automata Characterize Reversible Logarithmic Space. | Holger Bock Axelsen |
| 2012 | Measuring Information in Timed Languages. | Eugene Asarin |
| 2012 | Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits. | Vikraman Arvind, Yadu Vasudev |
| 2012 | Unification Modulo Chaining. | Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michal Rusinowitch |
| 2012 | The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems. | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman |
| 2011 | Restarting Automata with Auxiliary Symbols and Small Lookahead. | Natalie Schluter |
| 2011 | Undecidability of the State Complexity of Composed Regular Operations. | Arto Salomaa, Kai Salomaa, Sheng Yu |
| 2011 | Syntactic Complexity of Ultimately Periodic Sets of Integers. | Michel Rigo, lise Vandomme |