| 2014 | Linear time construction of compressed text indices in compact space. | Djamal Belazzougui |
| 2014 | Rounding sum-of-squares relaxations. | Boaz Barak, Jonathan A. Kelner, David Steurer |
| 2014 | Query complexity of approximate nash equilibria. | Yakov Babichenko |
| 2014 | The power of localization for efficiently learning linear separators with noise. | Pranjal Awasthi, Maria-Florina Balcan, Philip M. Long |
| 2014 | Pseudorandom generators with optimal seed length for non-boolean poly-size circuits. | Sergei Artemenko, Ronen Shaltiel |
| 2014 | Parallel algorithms for geometric graph problems. | Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, Grigory Yaroslavtsev |
| 2014 | Are lock-free concurrent algorithms practically wait-free? | Dan Alistarh, Keren Censor-Hillel, Nir Shavit |
| 2014 | Non-malleable codes from additive combinatorics. | Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett |
| 2014 | Approximation algorithms for bipartite matching with metric and geometric costs. | Pankaj K. Agarwal, R. Sharathkumar |
| 2014 | Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. | Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar |
| 2013 | On the list decodability of random linear codes with large error rates. | Mary Wootters |
| 2013 | Natural proofs versus derandomization. | Ryan Williams |
| 2013 | Answering n | Jonathan R. Ullman |
| 2013 | Bottom-k and priority sampling, set similarity and subset sums with minimal independence. | Mikkel Thorup |
| 2013 | The complexity of finite-valued CSPs. | Johan Thapper, Stanislav Zivn |
| 2013 | Inverting well conditioned matrices in quantum logspace. | Amnon Ta-Shma |
| 2013 | Composable and efficient mechanisms. | Vasilis Syrgkanis, va Tardos |
| 2013 | Lee-Yang theorems and the complexity of computing averages. | Alistair Sinclair, Piyush Srivastava |
| 2013 | Communication lower bounds using directional derivatives. | Alexander A. Sherstov |
| 2013 | Interactive proofs of proximity: delegating computation in sublinear time. | Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson |
| 2013 | Fast approximation algorithms for the diameter and radius of sparse graphs. | Liam Roditty, Virginia Vassilevska Williams |
| 2013 | Max flows in O(nm) time, or better. | James B. Orlin |
| 2013 | The geometry of differential privacy: the sparse and approximate cases. | Aleksandar Nikolov, Kunal Talwar, Li Zhang |
| 2013 | Sparsity lower bounds for dimensionality reducing maps. | Jelani Nelson, Huy L. Nguyen |
| 2013 | Simple deterministic algorithms for fully dynamic maximal matching. | Ofer Neiman, Shay Solomon |