| 2011 | A Master Theorem for Discrete Divide and Conquer Recurrences. | Michael Drmota, Wojciech Szpankowski |
| 2011 | Hardness Results for Agnostically Learning Low-Degree Polynomial Threshold Functions. | Ilias Diakonikolas, Ryan O'Donnell, Rocco A. Servedio, Yi Wu |
| 2011 | Algorithms and Hardness for Subspace Approximation. | Amit Deshpande, Madhur Tulsiani, Nisheeth K. Vishnoi |
| 2011 | Embedding Stacked Polytopes on a Polynomial-Size Grid. | Erik D. Demaine, Andr Schulz |
| 2011 | A complete resolution of the Keller maximum clique problem. | Jennifer Debroni, John D. Eblen, Michael A. Langston, Wendy J. Myrvold, Peter W. Shor, Dinesh Weerapurage |
| 2011 | Continuous Local Search. | Constantinos Daskalakis, Christos H. Papadimitriou |
| 2011 | Near-Optimal No-Regret Algorithms for Zero-Sum Games. | Constantinos Daskalakis, Alan Deckelbaum, Anthony Kim |
| 2011 | On the Complexity of Approximating a Nash Equilibrium. | Constantinos Daskalakis |
| 2011 | The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem). | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2011 | Randomized greedy: new variants of some classic approximation algorithms. | Kevin P. Costello, Asaf Shapira, Prasad Tetali |
| 2011 | Component structure of the vacant set induced by a random walk on a random graph. | Colin Cooper, Alan M. Frieze |
| 2011 | Networks of random cycles. | Colin Cooper, Martin E. Dyer, Andrew J. Handley |
| 2011 | Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D. | Matthew Cook, Yunhui Fu, Robert Schweller |
| 2011 | On independent sets in random graphs. | Amin Coja-Oghlan, Charilaos Efthymiou |
| 2011 | On Belief Propagation Guided Decimation for Random k-SAT. | Amin Coja-Oghlan |
| 2011 | On Graph Crossing Number and Edge Planarization. | Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos |
| 2011 | Algebraic Algorithms for Linear Matroid Parity Problems. | Ho Yee Cheung, Lap Chi Lau, Kai Man Leung |
| 2011 | Computing Shortest Paths amid Pseudodisks. | Danny Z. Chen, Haitao Wang |
| 2011 | On the Approximability of Budget Feasible Mechanisms. | Ning Chen, Nick Gravin, Pinyan Lu |
| 2011 | Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. | Chandra Chekuri, Jan Vondrk, Rico Zenklusen |
| 2011 | Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. | Krishnendu Chatterjee, Monika Henzinger |
| 2011 | Tight Hardness Results for Minimizing Discrepancy. | Moses Charikar, Alantha Newman, Aleksandar Nikolov |
| 2011 | Algorithms for Implicit Hitting Set Problems. | Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala |
| 2011 | Computational Geometry for Non-Geometers: Recent Developments on Some Classical Problems. | Timothy M. Chan |
| 2011 | Persistent Predecessor Search and Orthogonal point Location on the Word RAM. | Timothy M. Chan |