| 2013 | Knowledge-Preserving Interactive Coding. | Kai-Min Chung, Rafael Pass, Sidharth Telang |
| 2013 | Simultaneous Resettability from One-Way Functions. | Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Ivan Visconti |
| 2013 | Constant-Round Concurrent Zero Knowledge from P-Certificates. | Kai-Min Chung, Huijia Lin, Rafael Pass |
| 2013 | On Randomized Memoryless Algorithms for the Weighted K-Server Problem. | Ashish Chiplunkar, Sundar Vishwanathan |
| 2013 | Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. | Joseph Cheriyan, Lszl A. Vgh |
| 2013 | On Clustering Induced Voronoi Diagrams. | Danny Z. Chen, Ziyun Huang, Yangwei Liu, Jinhui Xu |
| 2013 | Approximation Algorithms for Euler Genus and Related Problems. | Chandra Chekuri, Anastasios Sidiropoulos |
| 2013 | Approximate Constraint Satisfaction Requires Large LP Relaxations. | Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer |
| 2013 | Klee's Measure Problem Made Easy. | Timothy M. Chan |
| 2013 | Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2013 | From Unprovability to Environmentally Friendly Protocols. | Ran Canetti, Huijia Lin, Rafael Pass |
| 2013 | Understanding Incentives: Mechanism Design Becomes Algorithm Design. | Yang Cai, Constantinos Daskalakis, S. Matthew Weinberg |
| 2013 | Direct Products in Communication Complexity. | Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff |
| 2013 | A Tight Bound for Set Disjointness in the Message-Passing Model. | Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan |
| 2013 | Common Information and Unique Disjointness. | Gbor Braun, Sebastian Pokutta |
| 2013 | An O(c^k n) 5-Approximation Algorithm for Treewidth. | Hans L. Bodlaender, Pl Grns Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
| 2013 | The Parity of Directed Hamiltonian Cycles. | Andreas Bjrklund, Thore Husfeldt |
| 2013 | The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant. | Vittorio Bil, Michele Flammini, Luca Moscardelli |
| 2013 | Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. | Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth |
| 2013 | Element Distinctness, Frequency Moments, and Sliding Windows. | Paul Beame, Raphal Clifford, Widad Machmouchi |
| 2013 | Coupled-Worlds Privacy: Exploiting Adversarial Uncertainty in Statistical Data Privacy. | Raef Bassily, Adam Groce, Jonathan Katz, Adam D. Smith |
| 2013 | A Linear Time Approximation Scheme for Euclidean TSP. | Yair Bartal, Lee-Ad Gottlieb |
| 2013 | Bandits with Knapsacks. | Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins |
| 2013 | Faster Canonical Forms for Strongly Regular Graphs. | Lszl Babai, Xi Chen, Xiaorui Sun, Shang-Hua Teng, John Wilmes |
| 2013 | An optimal randomized online algorithm for reordering buffer management. | Noa Avigdor-Elgrabli, Yuval Rabani |