| 2011 | Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages. | Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs |
| 2011 | Contracting a Chordal Graph to a Split Graph or a Tree. | Petr A. Golovach, Marcin Kaminski, Danil Paulusma |
| 2011 | Duality and Recognition. | Mai Gehrke |
| 2011 | On Minimising Automata with Errors. | Pawel Gawrychowski, Artur Jez, Andreas Maletti |
| 2011 | Distributed Synthesis for Regular and Contextfree Specifications. | Wladimir Fridman, Bernd Puchala |
| 2011 | Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable. | Peter Franek, Stefan Ratschan, Piotr Zgliczynski |
| 2011 | Invariantization of Listings. | Jrg Flum |
| 2011 | Parity Games on Graphs with Medium Tree-Width. | John Fearnley, Oded Lachish |
| 2011 | Infinite Synchronizing Words for Probabilistic Automata. | Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi |
| 2011 | On the Complexity of the l-diversity Problem. | Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
| 2011 | An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. | Evgeny Demenkov, Alexander S. Kulikov |
| 2011 | On the Use of Guards for Logics with Data. | Thomas Colcombet, Clemens Ley, Gabriele Puppis |
| 2011 | An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. | David A. Cohen, Pid Creed, Peter G. Jeavons, Stanislav Zivn |
| 2011 | The Role of Polymorphism in the Characterisation of Complexity by Soft Types. | Jacek Chrzaszcz, Aleksy Schubert |
| 2011 | Energy and Mean-Payoff Parity Markov Decision Processes. | Krishnendu Chatterjee, Laurent Doyen |
| 2011 | Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs. | Balder ten Cate, Alessandro Facchini |
| 2011 | Pattern-Guided Data Anonymization and Clustering. | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2011 | Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. | Olivier Bournez, Daniel Silva Graa, Amaury Pouly |
| 2011 | The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity. | Christina Boucher |
| 2011 | Weak Cost Monadic Logic over Infinite Trees. | Michael Vanden Boom |
| 2011 | The Reachability Problem for Vector Addition System with One Zero-Test. | Rmi Bonnet |
| 2011 | Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. | Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun |
| 2011 | Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. | Stanislav Bhm, Stefan Gller |
| 2011 | Hard Functions for Low-Degree Polynomials over Prime Fields. | Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka |
| 2011 | Model Checking Coverability Graphs of Vector Addition Systems. | Michel Blockelet, Sylvain Schmitz |