| 2013 | Some trade-off results for polynomial calculus: extended abstract. | Chris Beck, Jakob Nordstrm, Bangsheng Tang |
| 2013 | Strong ETH holds for regular resolution. | Christopher Beck, Russell Impagliazzo |
| 2013 | Quasipolynomial-time canonical form for steiner designs. | Lszl Babai, John Wilmes |
| 2013 | Tight bounds for online vector bin packing. | Yossi Azar, Ilan Reuven Cohen, Seny Kamara, F. Bruce Shepherd |
| 2013 | The loss of serving in the dark. | Yossi Azar, Ilan Reuven Cohen, Iftah Gamzu |
| 2013 | Homomorphic fingerprints under misalignments: sketching edit and shift distances. | Alexandr Andoni, Assaf Goldberger, Andrew McGregor, Ely Porat |
| 2013 | Superlinear advantage for exact quantum algorithms. | Andris Ambainis |
| 2013 | The approximate rank of a matrix and its algorithmic applications: approximate rank. | Noga Alon, Troy Lee, Adi Shraibman, Santosh S. Vempala |
| 2013 | Lower bounds for RAMs and quantifier elimination. | Mikls Ajtai |
| 2013 | Quasi-polynomial hitting-set for set-depth-Δ formulas. | Manindra Agrawal, Chandan Saha, Nitin Saxena |
| 2012 | Tight bounds for distributed functional monitoring. | David P. Woodruff, Qin Zhang |
| 2012 | Multiplying matrices faster than coppersmith-winograd. | Virginia Vassilevska Williams |
| 2012 | Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. | Lszl A. Vgh |
| 2012 | Certifiable quantum dice: or, true random number generation secure against quantum adversaries. | Umesh V. Vazirani, Thomas Vidick |
| 2012 | Characterizing pseudoentropy and simplifying pseudorandom generator constructions. | Salil P. Vadhan, Colin Jia Zheng |
| 2012 | Making polynomials robust to noise. | Alexander A. Sherstov |
| 2012 | The multiparty communication complexity of set disjointness. | Alexander A. Sherstov |
| 2012 | A near-linear time ε-approximation algorithm for geometric bipartite matching. | R. Sharathkumar, Pankaj K. Agarwal |
| 2012 | Approximating the exponential, the lanczos method and an ( | Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi |
| 2012 | A new point of NP-hardness for unique games. | Ryan O'Donnell, John Wright |
| 2012 | Optimal private halfspace counting via discrepancy. | S. Muthukrishnan, Aleksandar Nikolov |
| 2012 | A quantitative gibbard-satterthwaite theorem without neutrality. | Elchanan Mossel, Mikls Z. Rcz |
| 2012 | The freezing threshold for k-colourings of a random graph. | Michael Molloy |
| 2012 | Approximation algorithms for semi-random partitioning problems. | Konstantin Makarychev, Yury Makarychev, Aravindan Vijayaraghavan |
| 2012 | Many sparse cuts via higher eigenvalues. | Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala |