| 2013 | More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding. | Andreas Frhlich, Gergely Kovsznai, Armin Biere |
| 2013 | Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams. | Luke Friedman, Yixin Xu |
| 2013 | Dichotomy of the H-Quasi-Cover Problem. | Jir Fiala, Marek Tesar |
| 2013 | Random Generation of Deterministic Acyclic Automata Using the Recursive Method. | Sven De Felice, Cyril Nicaud |
| 2013 | Multi-weighted Automata and MSO Logic. | Manfred Droste, Vitaly Perevoshchikov |
| 2013 | Real Numbers, Chaos, and the Principle of a Bounded Density of Information. | Gilles Dowek |
| 2013 | QuickHeapsort: Modifications and Improved Analysis. | Volker Diekert, Armin Wei |
| 2013 | Parameterized Resolution with Bounded Conjunction. | Stefan S. Dantchev, Barnaby Martin |
| 2013 | Composition with Algebra at the Background - On a Question by Gurevich and Rabinovich on the Monadic Theory of Linear Orderings. | Thomas Colcombet |
| 2013 | Information Lower Bounds via Self-reducibility. | Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein |
| 2013 | The Probabilistic Min Dominating Set Problem. | Nicolas Boria, Ccile Murat, Vangelis Th. Paschos |
| 2013 | Model-Checking Bounded Multi-Pushdown Systems. | Kshitij Bansal, Stphane Demri |
| 2013 | Weak Abelian Periodicity of Infinite Words. | Sergey V. Avgustinovich, Svetlana Puzynina |
| 2012 | Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"? | Vijay V. Vazirani |
| 2012 | Boolean Composition of Visual Secret Sharing Schemes. | Hans Ulrich Simon |
| 2012 | Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time. | Svetlana N. Selezneva |
| 2012 | A Characterization of Cellular Automata Generated by Idempotents on the Full Shift. | Ville Salo |
| 2012 | Some Results on more Flexible Versions of Graph Motif. | Romeo Rizzi, Florian Sikora |
| 2012 | Space-Bounded Kolmogorov Extractors. | Daniil Musatov |
| 2012 | Constraint Satisfaction with Counting Quantifiers. | Florent R. Madelaine, Barnaby Martin, Juraj Stacho |
| 2012 | On the Advice Complexity of the Set Cover Problem. | Dennis Komm, Richard Krlovic, Tobias Mmke |
| 2012 | Cutting through Regular Post Embedding Problems. | Prateek Karandikar, Philippe Schnoebelen |
| 2012 | Two-Way Automata Characterizations of L/poly versus NL. | Christos A. Kapoutsis, Giovanni Pighizzini |
| 2012 | Consistency of Multidimensional Combinatorial Substitutions. | Timo Jolivet, Jarkko Kari |
| 2012 | Descriptional Complexity of Operations on Alternating and Boolean Automata. | Galina Jirskov |