| 2013 | Towards a Better Approximation for Sparsest Cut? | Sanjeev Arora, Rong Ge, Ali Kemal Sinop |
| 2013 | The Simple Economics of Approximately Optimal Auctions. | Saeed Alaei, Hu Fu, Nima Haghpanah, Jason D. Hartline |
| 2013 | Approximation Schemes for Maximum Weight Independent Set of Rectangles. | Anna Adamaszek, Andreas Wiese |
| 2013 | Arithmetic Circuits: A Chasm at Depth Three. | Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi |
| 2012 | How to Construct Quantum Random Functions. | Mark Zhandry |
| 2012 | Population Recovery and Partial Identification. | Avi Wigderson, Amir Yehudayoff |
| 2012 | A Permanent Approach to the Traveling Salesman Problem. | Nisheeth K. Vishnoi |
| 2012 | Concave Generalized Flows with Applications to Market Equilibria. | Lszl A. Vgh |
| 2012 | Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas. | Gregory Valiant |
| 2012 | The Power of Linear Programming for Valued CSPs. | Johan Thapper, Stanislav Zivn |
| 2012 | Almost Optimal Canonical Property Testers for Satisfiability. | Christian Sohler |
| 2012 | The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs. | Allan Sly, Nike Sun |
| 2012 | Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. | Thomas Sauerwald, He Sun |
| 2012 | A Weight-Scaling Algorithm for Min-Cost Imperfect Matchings in Bipartite Graphs. | Lyle Ramshaw, Robert Endre Tarjan |
| 2012 | Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis. | Matthias Poloczek, Mario Szegedy |
| 2012 | A New Infinity of Distance Oracles for Sparse Graphs. | Mihai Patrascu, Liam Roditty, Mikkel Thorup |
| 2012 | Beck's Three Permutations Conjecture: A Counterexample and Some Consequences. | Alantha Newman, Ofer Neiman, Aleksandar Nikolov |
| 2012 | Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma. | Ketan Mulmuley |
| 2012 | A PTAS for Computing the Supremum of Gaussian Processes. | Raghu Meka |
| 2012 | Online Matching with Stochastic Rewards. | Aranyak Mehta, Debmalya Panigrahi |
| 2012 | Constructive Discrepancy Minimization by Walking on the Edges. | Shachar Lovett, Raghu Meka |
| 2012 | Non-malleable Extractors, Two-Source Extractors and Privacy Amplification. | Xin Li |
| 2012 | Rarity for Semimeasures. | Leonid A. Levin |
| 2012 | On the Homotopy Test on Surfaces. | Francis Lazarus, Julien Rivaud |
| 2012 | Higher Cell Probe Lower Bounds for Evaluating Polynomials. | Kasper Green Larsen |