| 2014 | Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. | Peyman Afshani, Timothy M. Chan, Konstantinos Tsakalidis |
| 2014 | Labeling Schemes for Bounded Degree Graphs. | David Adjiashvili, Noy Rotbart |
| 2014 | Time-Expanded Packings. | David Adjiashvili, Sandro Bosio, Robert Weismantel, Rico Zenklusen |
| 2014 | Distance Labels with Optimal Local Stretch. | Ittai Abraham, Shiri Chechik |
| 2014 | Consequences of Faster Alignment of Sequences. | Amir Abboud, Virginia Vassilevska Williams, Oren Weimann |
| 2014 | Weak Parity. | Scott Aaronson, Andris Ambainis, Kaspars Balodis, Mohammad Bavarian |
| 2014 | Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods. | Oliver Gbel, Martin Hoefer, Thomas Kesselheim, Thomas Schleiden, Berthold Vcking |
| 2013 | Silent Transitions in Automata with Storage. | Georg Zetzsche |
| 2013 | Revisiting the Equivalence Problem for Finite Multitape Automata. | James Worrell |
| 2013 | Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials. | Kevin Woods |
| 2013 | Testing Linear-Invariant Function Isomorphism. | Karl Wimmer, Yuichi Yoshida |
| 2013 | To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous. | Peter Widmayer |
| 2013 | Approximating the Diameter of Planar Graphs in Near Linear Time. | Oren Weimann, Raphael Yuster |
| 2013 | The Complexity of Infinitely Repeated Alternating Move Games. | Yaron Velner |
| 2013 | The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom. | Hannes Uppman |
| 2013 | Large Neighborhood Local Search for the Maximum Set Packing Problem. | Maxim Sviridenko, Justin Ward |
| 2013 | Proof Systems for Retracts in Simply Typed Lambda Calculus. | Colin Stirling |
| 2013 | A Guided Tour in Random Intersection Graphs. | Paul G. Spirakis, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos |
| 2013 | Fast Distributed Coloring Algorithms for Triangle-Free Graphs. | Seth Pettie, Hsin-Hao Su |
| 2013 | Coeffects: Unified Static Analysis of Context-Dependence. | Tomas Petricek, Dominic A. Orchard, Alan Mycroft |
| 2013 | Fair Subtyping for Open Session Types. | Luca Padovani |
| 2013 | A Composition Theorem for the Fourier Entropy-Influence Conjecture. | Ryan O'Donnell, Li-Yang Tan |
| 2013 | No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem. | Marcin Mucha, Maxim Sviridenko |
| 2013 | Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms. | Gabriel Moruz, Andrei Negoescu |
| 2013 | Strong Bounds for Evolution in Networks. | George B. Mertzios, Paul G. Spirakis |