| 2011 | A Universally Defined Undecidable Unimodal Logic. Edith Hemaspaandra, Henning Schnoor |
| 2011 | Adhesivity Is Not Enough: Local Church-Rosser Revisited. Paolo Baldan, Fabio Gadducci, Pawel Sobocinski |
| 2011 | An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection. David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivný |
| 2011 | An Elementary Proof of a 3n - o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. Evgeny Demenkov, Alexander S. Kulikov |
| 2011 | Can Everybody Sit Closer to Their Friends Than Their Enemies? Anne-Marie Kermarrec, Christopher Thraves |
| 2011 | Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs. Balder ten Cate, Alessandro Facchini |
| 2011 | Compressed Word Problems for Inverse Monoids. Markus Lohrey |
| 2011 | Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. Christophe Paul, Anthony Perez, Stéphan Thomassé |
| 2011 | Contracting a Chordal Graph to a Split Graph or a Tree. Petr A. Golovach, Marcin Kaminski, Daniël Paulusma |
| 2011 | Distributed Synthesis for Regular and Contextfree Specifications. Wladimir Fridman, Bernd Puchala |
| 2011 | Duality and Recognition. Mai Gehrke |
| 2011 | Energy and Mean-Payoff Parity Markov Decision Processes. Krishnendu Chatterjee, Laurent Doyen |
| 2011 | Faster Coupon Collecting via Replication with Applications in Gossiping. Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald |
| 2011 | Generic Techniques to Round SDP Relaxations. Prasad Raghavendra |
| 2011 | Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols. Krzysztof Krzywdzinski, Katarzyna Rybarczyk |
| 2011 | Hard Functions for Low-Degree Polynomials over Prime Fields. Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka |
| 2011 | Infinite Synchronizing Words for Probabilistic Automata. Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi |
| 2011 | Invariantization of Listings. Jörg Flum |
| 2011 | Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. Stanislav Böhm, Stefan Göller |
| 2011 | Linear Problem Kernels for Planar Graph Problems with Small Distance Property. Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen |
| 2011 | Lower Bounds for Linear Decision Trees via an Energy Complexity Argument. Kei Uchizawa, Eiji Takimoto |
| 2011 | Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings Filip Murlak, Piotr Sankowski |
| 2011 | Model Checking Coverability Graphs of Vector Addition Systems. Michel Blockelet, Sylvain Schmitz |
| 2011 | Nearest Neighbor Search in High-Dimensional Spaces. Alexandr Andoni |
| 2011 | New Parameterized Algorithms for the Edge Dominating Set Problem. Mingyu Xiao, Ton Kloks, Sheung-Hung Poon |
| 2011 | New Proofs in Graph Minors. Paul Wollan |
| 2011 | On Minimising Automata with Errors. Pawel Gawrychowski, Artur Jez, Andreas Maletti |
| 2011 | On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada |
| 2011 | On the Complexity of the l-diversity Problem. Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
| 2011 | On the Use of Guards for Logics with Data. Thomas Colcombet, Clemens Ley, Gabriele Puppis |
| 2011 | Parity Games on Graphs with Medium Tree-Width. John Fearnley, Oded Lachish |
| 2011 | Pattern-Guided Data Anonymization and Clustering. Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2011 | Periodicity Algorithms for Partial Words. Florin Manea, Robert Mercas, Catalin Tiseanu |
| 2011 | Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach. Michal Pilipczuk |
| 2011 | Pushing for Weighted Tree Automata. Andreas Maletti, Daniel Quernheim |
| 2011 | Quantitative Refinement for Weighted Modal Transition Systems. Sebastian S. Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay, Claus R. Thrane |
| 2011 | Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages. Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs |
| 2011 | Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable. Peter Franek, Stefan Ratschan, Piotr Zgliczynski |
| 2011 | Size and Computation of Injective Tree Automatic Presentations. Dietrich Kuske, Thomas Weidner |
| 2011 | Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. Olivier Bournez, Daniel Silva Graça, Amaury Pouly |
| 2011 | Some Variants of the Star Height Problem. Daniel Kirsten |
| 2011 | State Complexity of Operations on Input-Driven Pushdown Automata. Alexander Okhotin, Kai Salomaa |
| 2011 | Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. Andreas Krebs, Nutan Limaye, Srikanth Srinivasan |
| 2011 | Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions. Vladimir Kolmogorov |
| 2011 | Symmetric Functions Capture General Functions. Richard J. Lipton, Kenneth W. Regan, Atri Rudra |
| 2011 | Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun |
| 2011 | The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity. Christina Boucher |
| 2011 | The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. Markus Bläser, Radu Curticapean |
| 2011 | The Least-Core of Threshold Network Flow Games. Yoram Bachrach |
| 2011 | The Reachability Problem for Vector Addition System with One Zero-Test. Rémi Bonnet |
| 2011 | The Role of Polymorphism in the Characterisation of Complexity by Soft Types. Jacek Chrzaszcz, Aleksy Schubert |
| 2011 | Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. Kévin Perrot, Eric Rémila |
| 2011 | Untimed Language Preservation in Timed Systems. Ocan Sankur |
| 2011 | Verifying Proofs in Constant Depth. Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer |
| 2011 | Weak Cost Monadic Logic over Infinite Trees. Michael Vanden Boom |