| 2011 | Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits. | Craig Gentry, Shai Halevi |
| 2011 | Efficient and Explicit Coding for Interactive Communication. | Ran Gelles, Ankur Moitra, Amit Sahai |
| 2011 | Local Distributed Decision. | Pierre Fraigniaud, Amos Korman, David Peleg |
| 2011 | A Unified Continuous Greedy Algorithm for Submodular Maximization. | Moran Feldman, Joseph Naor, Roy Schwartz |
| 2011 | An Algebraic Proof of a Robust Social Choice Impossibility Theorem. | Dvir Falik, Ehud Friedgut |
| 2011 | Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones. | Michael Elkin, Shay Solomon |
| 2011 | The Promise of Differential Privacy: A Tutorial on Algorithmic Techniques. | Cynthia Dwork |
| 2011 | Limitations of Randomized Mechanisms for Combinatorial Auctions. | Shaddin Dughmi, Jan Vondrk |
| 2011 | Privacy Amplification and Non-malleable Extractors via Character Sums. | Yevgeniy Dodis, Xin Li, Trevor D. Wooley, David Zuckerman |
| 2011 | Storing Secrets on Continually Leaky Devices. | Yevgeniy Dodis, Allison B. Lewko, Brent Waters, Daniel Wichs |
| 2011 | Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings. | Daniel Dadush, Chris Peikert, Santosh S. Vempala |
| 2011 | Planar Graphs: Random Walks and Bipartiteness Testing. | Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, Christian Sohler |
| 2011 | Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. | Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk |
| 2011 | The Randomness Complexity of Parallel Repetition. | Kai-Min Chung, Rafael Pass |
| 2011 | Markov Layout. | Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan |
| 2011 | Graph Connectivities, Network Coding, and Expander Graphs. | Ho Yee Cheung, Lap Chi Lau, Kai Man Leung |
| 2011 | Mechanism Design with Set-Theoretic Beliefs. | Jing Chen, Silvio Micali |
| 2011 | Approximation Algorithms for Submodular Multiway Partition. | Chandra Chekuri, Alina Ene |
| 2011 | Optimal Bounds for Quantum Bit Commitment. | Andr Chailloux, Iordanis Kerenidis |
| 2011 | Balls and Bins: Smaller Hash Families and Faster Evaluation. | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder |
| 2011 | Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games. | Ioannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik |
| 2011 | Sharp Mixing Time Bounds for Sampling Random Surfaces. | Pietro Caputo, Fabio Martinelli, Fabio Lucio Toninelli |
| 2011 | Extreme-Value Theorems for Optimal Multidimensional Pricing. | Yang Cai, Constantinos Daskalakis |
| 2011 | Information Equals Amortized Communication. | Mark Braverman, Anup Rao |
| 2011 | The Grothendieck Constant is Strictly Smaller than Krivine's Bound. | Mark Braverman, Konstantin Makarychev, Yury Makarychev, Assaf Naor |