| 2014 | Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. | Sungjin Im, Janardhan Kulkarni, Kamesh Munagala |
| 2014 | Private matchings and allocations. | Justin Hsu, Zhiyi Huang, Aaron Roth, Tim Roughgarden, Zhiwei Steven Wu |
| 2014 | Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| 2014 | An almost-optimally fair three-party coin-flipping protocol. | Iftach Haitner, Eliad Tsfadia |
| 2014 | Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. | Venkatesan Guruswami, Prahladh Harsha, Johan Hstad, Srikanth Srinivasan, Girish Varma |
| 2014 | Deciding first-order properties of nowhere dense graphs. | Martin Grohe, Stephan Kreutzer, Sebastian Siebertz |
| 2014 | Fourier PCA and robust tensor decomposition. | Navin Goyal, Santosh S. Vempala, Ying Xiao |
| 2014 | Black-box non-black-box zero knowledge. | Vipul Goyal, Rafail Ostrovsky, Alessandra Scafuro, Ivan Visconti |
| 2014 | Communication lower bounds via critical block sensitivity. | Mika Gs, Toniann Pitassi |
| 2014 | Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time. | Michael T. Goodrich |
| 2014 | On derandomizing algorithms that err extremely rarely. | Oded Goldreich, Avi Wigderson |
| 2014 | Optimal error rates for interactive coding I: adaptivity and other settings. | Mohsen Ghaffari, Bernhard Haeupler, Madhu Sudan |
| 2014 | Circuits resilient to additive attacks with applications to secure computation. | Daniel Genkin, Yuval Ishai, Manoj Prabhakaran, Amit Sahai, Eran Tromer |
| 2014 | Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture. | Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson |
| 2014 | Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions. | Jugal Garg, Ruta Mehta, Vijay V. Vazirani |
| 2014 | Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2014 | Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. | Zachary Friggstad, Chaitanya Swamy |
| 2014 | Lower bounds for depth 4 formulas computing iterated matrix multiplication. | Herv Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan |
| 2014 | Hitting sets for multilinear read-once algebraic branching programs, in any order. | Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka |
| 2014 | Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements. | Alina Ene, Ali Vakilian |
| 2014 | Embedding and canonizing graphs of bounded genus in logspace. | Michael Elberfeld, Ken-ichi Kawarabayashi |
| 2014 | A quantum algorithm for computing the unit group of an arbitrary degree number field. | Kirsten Eisentrger, Sean Hallgren, Alexei Y. Kitaev, Fang Song |
| 2014 | Analyze gauss: optimal bounds for privacy-preserving principal component analysis. | Cynthia Dwork, Kunal Talwar, Abhradeep Thakurta, Li Zhang |
| 2014 | Breaking the quadratic barrier for 3-LCC's over the reals. | Zeev Dvir, Shubhangi Saraf, Avi Wigderson |
| 2014 | Economic efficiency requires interaction. | Shahar Dobzinski, Noam Nisan, Sigal Oren |