| 2014 | Counting Popular Matchings in House Allocation Problems. | Rupam Acharyya, Sourav Chakraborty, Nitesh Jha |
| 2013 | One-Counter Verifiers for Decidable Languages. | Abuzer Yakaryilmaz |
| 2013 | Quantum Alternation. | Abuzer Yakaryilmaz |
| 2013 | Towards NEXP versus BPP? | Ryan Williams |
| 2013 | Universality of Regular Realizability Problems. | Mikhail N. Vyalyi |
| 2013 | Improving on Gutfreund, Shaltiel, and Ta-Shma's Paper "If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances". | Nikolay K. Vereshchagin |
| 2013 | The Lovsz Local Lemma - A Survey. | Mario Szegedy |
| 2013 | Random Selection in Few Rounds. | Timofey Stepanov |
| 2013 | Potential Functions in Strategic Games. | Paul G. Spirakis, Panagiota N. Panagopoulou |
| 2013 | Lower and Upper Bounds for the Length of Joins in the Lambek Calculus. | Alexey Sorokin |
| 2013 | Decidability and Enumeration for Automatic Sequences: A Survey. | Jeffrey O. Shallit |
| 2013 | A Short Tutorial on Order-Invariant First-Order Logic. | Nicole Schweikardt |
| 2013 | On Recognizing Words That Are Squares for the Shuffle Product. | Romeo Rizzi, Stphane Vialette |
| 2013 | Amortized Communication Complexity of an Equality Predicate. | Vladimir Nikishkin |
| 2013 | Careful Synchronization of Partial Automata with Restricted Alphabets. | Pavel V. Martyugin |
| 2013 | Walking on Data Words. | Amaldev Manuel, Anca Muscholl, Gabriele Puppis |
| 2013 | On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles. | Anton Makhlin |
| 2013 | QCSP on Partially Reflexive Cycles - The Wavy Line of Tractability. | Florent R. Madelaine, Barnaby Martin |
| 2013 | On Coloring of Sparse Graphs. | Alexandr V. Kostochka, Matthew P. Yancey |
| 2013 | Cyclic Shift on Prefix-Free Languages. | Jozef Jirsek, Galina Jirskov |
| 2013 | An Improved Knapsack Solver for Column Generation. | Klaus Jansen, Stefan Erich Julius Kraft |
| 2013 | Overlapping Tile Automata. | David Janin |
| 2013 | Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP. | Dmitry Itsykson, Vsevolod Oparin |
| 2013 | Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height. | Viliam Geffert, Zuzana Bednrov, Carlo Mereghetti, Beatrice Palano |
| 2013 | Alphabetic Minimax Trees in Linear Time. | Pawel Gawrychowski |