| 2013 | The Space Complexity of 2-Dimensional Approximate Range Counting. | Zhewei Wei, Ke Yi |
| 2013 | Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs. | Freek van Walderveen, Norbert Zeh, Lars Arge |
| 2013 | The communication complexity of addition. | Emanuele Viola |
| 2013 | Fuel Efficient Computation in Passive Self-Assembly. | Robert Schweller, Michael Sherman |
| 2013 | Exponential Lower Bounds for the PPSZ | Dominik Scheder, Bangsheng Tang, Shiteng Chen, Navid Talebanfard |
| 2013 | Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance. | Michael E. Saks, C. Seshadhri |
| 2013 | Breaking the n | David J. Rosenbaum |
| 2013 | Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities. | Dana Ron, Rocco A. Servedio |
| 2013 | Decremental maintenance of strongly connected components. | Liam Roditty |
| 2013 | Learning pseudo-Boolean | Sofya Raskhodnikova, Grigory Yaroslavtsev |
| 2013 | Lower Bounds for Adaptive Sparse Recovery. | Eric Price, David P. Woodruff |
| 2013 | The simplex method is strongly polynomial for deterministic Markov decision processes. | Ian Post, Yinyu Ye |
| 2013 | Є-Samples for Kernels. | Jeff M. Phillips |
| 2013 | Twisted Tabulation Hashing. | Mihai Patrascu, Mikkel Thorup |
| 2013 | Approximability and proof complexity. | Ryan O'Donnell, Yuan Zhou |
| 2013 | Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. | Ralph Neininger, Kevin Leckey, Wojciech Szpankowski |
| 2013 | Optimal Dynamic Sequence Representations. | Gonzalo Navarro, Yakov Nekrich |
| 2013 | Lyndon Words and Short Superstrings. | Marcin Mucha |
| 2013 | Frozen variables in random boolean constraint satisfaction problems. | Michael Molloy, Ricardo Restrepo |
| 2013 | Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching. | Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev |
| 2013 | An Almost Optimal Algorithm for Computing Nonnegative Rank. | Ankur Moitra |
| 2013 | Approximating Watchman Routes. | Joseph S. B. Mitchell |
| 2013 | Approximate Maximum Flow on Separable Undirected Graphs. | Gary L. Miller, Richard Peng |
| 2013 | Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes. | Chih-Hung Liu, D. T. Lee |
| 2013 | Correlation Decay up to Uniqueness in Spin Systems. | Liang Li, Pinyan Lu, Yitong Yin |