| 2012 | Low Randomness Rumor Spreading via Hashing. | George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel |
| 2012 | Tying up the loose ends in fully LZW-compressed pattern matching. | Pawel Gawrychowski |
| 2012 | Lower Bounds on the Complexity of MSO_1 Model-Checking. | Robert Ganian, Petr Hlinen, Alexander Langer, Jan Obdrzlek, Peter Rossmanith, Somnath Sikdar |
| 2012 | Monomials in arithmetic circuits: Complete problems in the counting hierarchy. | Herv Fournier, Guillaume Malod, Stefan Mengel |
| 2012 | Parameterized Complexity of Connected Even/Odd Subgraph Problems. | Fedor V. Fomin, Petr A. Golovach |
| 2012 | The Determinacy of Context-Free Games. | Olivier Finkel |
| 2012 | The Power of Local Search: Maximum Coverage over a Matroid. | Yuval Filmus, Justin Ward |
| 2012 | Balanced Partitions of Trees and Applications. | Andreas Emil Feldmann, Luca Foschini |
| 2012 | Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. | Michael Elberfeld, Andreas Jakoby, Till Tantau |
| 2012 | Motion planning with pulley, rope, and baskets. | Christian Eggermont, Gerhard J. Woeginger |
| 2012 | Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents. | Christoph Drr, Thomas Wilke |
| 2012 | Ehrenfeucht-Frass goes elementarily automatic for structures of bounded degree. | Antoine Durand-Gasselin, Peter Habermehl |
| 2012 | Playing Mastermind With Constant-Size Memory. | Benjamin Doerr, Carola Winzen |
| 2012 | On Randomness in Hash Functions (Invited Talk). | Martin Dietzfelbinger |
| 2012 | Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. | Volker Diekert, Jrn Laun, Alexander Ushakov |
| 2012 | Improved Bounds for Bipartite Matching on Surfaces. | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari |
| 2012 | Forms of Determinism for Automata (Invited Talk). | Thomas Colcombet |
| 2012 | Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. | Kai-Min Chung, Henry Lam, Zhenming Liu, Michael Mitzenmacher |
| 2012 | On Computing Pareto Stable Assignments. | Ning Chen |
| 2012 | Linear-Space Data Structures for Range Mode Query in Arrays. | Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, Bryan T. Wilkinson |
| 2012 | Distribution of the number of accessible states in a random deterministic automaton. | Arnaud Carayol, Cyril Nicaud |
| 2012 | Log-supermodular functions, functional clones and counting CSPs. | Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum |
| 2012 | Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. | Gerth Stlting Brodal, Casper Kejlberg-Rasmussen |
| 2012 | The Limits of Decidability for First Order Logic on CPDA Graphs. | Christopher H. Broadbent |
| 2012 | Stabilization of Branching Queueing Networks. | Toms Brzdil, Stefan Kiefer |