| 2013 | The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk). | Kousha Etessami |
| 2013 | Improved Bounds for Online Preemptive Matching. | Leah Epstein, Asaf Levin, Danny Segev, Oren Weimann |
| 2013 | First Fit bin packing: A tight analysis. | Gyrgy Dsa, Jir Sgall |
| 2013 | Two-variable first order logic with modular predicates over words. | Luc Dartois, Charles Paperman |
| 2013 | Unlabeled Data Does Provably Help. | Malte Darnstdt, Hans Ulrich Simon, Balzs Szrnyi |
| 2013 | On Pairwise Spanners. | Marek Cygan, Fabrizio Grandoni, Telikepalli Kavitha |
| 2013 | Approximate comparison of distance automata. | Thomas Colcombet, Laure Daviaud |
| 2013 | A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms. | Julien Clment, Thu Hien Nguyen Thi, Brigitte Valle |
| 2013 | L_1 Shortest Path Queries among Polygonal Obstacles in the Plane. | Danny Z. Chen, Haitao Wang |
| 2013 | The complexity of approximating conservative counting CSPs. | Xi Chen, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, David Richerby |
| 2013 | Mutual Dimension. | Adam Case, Jack H. Lutz |
| 2013 | The arithmetic complexity of tensor contractions. | Florent Capelli, Arnaud Durand, Stefan Mengel |
| 2013 | Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. | Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow |
| 2013 | Search using queries on indistinguishable items. | Mark Braverman, Gal Oshri |
| 2013 | Graph coloring, communication complexity and the stubborn problem (Invited talk). | Nicolas Bousquet, Aurlie Lagoutte, Stphan Thomass |
| 2013 | Regular languages of thin trees. | Mikolaj Bojanczyk, Tomasz Idziaszek, Michal Skrzypczak |
| 2013 | Probably Optimal Graph Motifs. | Andreas Bjrklund, Petteri Kaski, Lukasz Kowalik |
| 2013 | On the practically interesting instances of MAXCUT. | Yonatan Bilu, Amit Daniely, Nati Linial, Michael E. Saks |
| 2013 | Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract). | Amir M. Ben-Amram |
| 2013 | Space-Time Trade-offs for Stack-Based Algorithms. | Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane |
| 2013 | The PCP theorem for NP over the reals. | Martijn Baartse, Klaus Meer |
| 2013 | Bounded-width QBF is PSPACE-complete. | Albert Atserias, Sergi Oliva |
| 2013 | Optimal quantum query bounds for almost all Boolean functions. | Andris Ambainis, Arturs Backurs, Juris Smotrovs, Ronald de Wolf |
| 2013 | Algorithms for Designing Pop-Up Cards. | Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andr Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow |
| 2012 | The Field of Reals is not omega-Automatic. | Faried Abu Zaid, Erich Grdel, Lukasz Kaiser |