| 2013 | Communication Complexity of Combinatorial Auctions with Submodular Valuations. | Shahar Dobzinski, Jan Vondrk |
| 2013 | Matroid Secretary for Regular and Decomposable Matroids. | Michael Dinitz, Guy Kortsarz |
| 2013 | Anonymous Meeting in Networks. | Yoann Dieudonn, Andrzej Pelc |
| 2013 | Weighted Graph Laplace Operator under Topological Noise. | Tamal K. Dey, Pawas Ranjan, Yusu Wang |
| 2013 | Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching. | Nikhil R. Devanur, Kamal Jain, Robert D. Kleinberg |
| 2013 | Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's". | Erik D. Demaine, Morteza Zadimoghaddam |
| 2013 | Ironing in Dynamic Revenue Management: Posted Prices & Biased Auctions. | Rahul Deb, Mallesh M. Pai |
| 2013 | Testing | Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, Paul Valiant |
| 2013 | Algorithms for the Densest Sub-Lattice Problem. | Daniel Dadush, Daniele Micciancio |
| 2013 | Lattice Sparsification and the Approximate Closest Vector Problem. | Daniel Dadush, Gbor Kun |
| 2013 | Active Self-Assembly of Simple Units Using an Insertion Primitive. | Nadine Dabby, Ho-Lin Chen |
| 2013 | (1+ Є)-approximation for facility location in data streams. | Artur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler |
| 2013 | Known algorithms for EDGE CLIQUE COVER are probably optimal. | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk |
| 2013 | How to Sell Hyperedges: The Hypermatching Assignment Problem. | Marek Cygan, Fabrizio Grandoni, Monaldo Mastrolilli |
| 2013 | Fast matrix multiplication using coherent configurations. | Henry Cohn, Christopher Umans |
| 2013 | Tight Cell-Probe Bounds for Online Hamming Distance Computation. | Raphal Clifford, Markus Jalsenius, Benjamin Sach |
| 2013 | The Fast Cauchy Transform and Faster Robust Linear Regression. | Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff |
| 2013 | Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. | Mahdi Cheraghchi, Venkatesan Guruswami, Ameya Velingker |
| 2013 | Approximate Shortest Descending Paths. | Siu-Wing Cheng, Jiongxin Jin |
| 2013 | Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion. | Chandra Chekuri, Alina Ene |
| 2013 | New Additive Spanners. | Shiri Chechik |
| 2013 | Adaptive and Approximate Orthogonal Range Counting. | Timothy M. Chan, Bryan T. Wilkinson |
| 2013 | Learning mixtures of structured distributions over discrete domains. | Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun |
| 2013 | Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. | Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai |
| 2013 | Regret Minimization for Reserve Prices in Second-Price Auctions. | Nicol Cesa-Bianchi, Claudio Gentile, Yishay Mansour |