| 2013 | A Forward-Backward Single-Source Shortest Paths Algorithm. | David B. Wilson, Uri Zwick |
| 2013 | Three-Player Entangled XOR Games Are NP-Hard to Approximate. | |
| 2013 | Strong LTCs with Inverse Poly-Log Rate and Constant Soundness. | Michael Viderman |
| 2013 | Fourier Sparsity, Spectral Norm, and the Log-Rank Conjecture. | Hing Yin Tsang, Chung Hoi Wong, Ning Xie, Shengyu Zhang |
| 2013 | Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence. | Mikkel Thorup |
| 2013 | Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant. | Alistair Sinclair, Piyush Srivastava, Yitong Yin |
| 2013 | Non-positive Curvature and the Planar Embedding Conjecture. | Anastasios Sidiropoulos |
| 2013 | Nearly Maximum Flows in Nearly Linear Time. | Jonah Sherman |
| 2013 | Adaptive Seeding in Social Networks. | Lior Seeman, Yaron Singer |
| 2013 | On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems. | Mert Saglam, Gbor Tardos |
| 2013 | On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions. | Natan Rubin |
| 2013 | Approximating Bin Packing within O(log OPT * Log Log OPT) Bins. | Thomas Rothvo |
| 2013 | How to Approximate a Set without Knowing Its Size in Advance. | Rasmus Pagh, Gil Segev, Udi Wieder |
| 2013 | OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings. | Jelani Nelson, Huy L. Nguyen |
| 2013 | A Polynomial Time Algorithm for Lossy Population Recovery. | Ankur Moitra, Michael E. Saks |
| 2013 | Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees. | Adam Marcus, Daniel A. Spielman, Nikhil Srivastava |
| 2013 | Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back. | Aleksander Madry |
| 2013 | The Complexity of Approximating Vertex Expansion. | Anand Louis, Prasad Raghavendra, Santosh S. Vempala |
| 2013 | Iterative Row Sampling. | Mu Li, Gary L. Miller, Richard Peng |
| 2013 | Extractors for a Constant Number of Independent Sources with Polylogarithmic Min-Entropy. | Xin Li |
| 2013 | Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems. | Yin Tat Lee, Aaron Sidford |
| 2013 | An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree. | Jochen Knemann, Sina Sadeghian Sadeghabad, Laura Sanit |
| 2013 | Improved Average-Case Lower Bounds for DeMorgan Formula Size. | Ilan Komargodski, Ran Raz, Avishay Tal |
| 2013 | All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs. | Ken-ichi Kawarabayashi, Yusuke Kobayashi |
| 2013 | A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits. | Russell Impagliazzo, Ramamohan Paturi, Stefan Schneider |