| 2014 | On Learning, Lower Bounds and (un)Keeping Promises. | Ilya Volkovich |
| 2014 | Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem - (Extended Abstract). | Iddo Tzameret |
| 2014 | Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs. | Madhur Tulsiani, John Wright, Yuan Zhou |
| 2014 | Balanced Allocations: A Simple Proof for the Heavily Loaded Case. | Kunal Talwar, Udi Wieder |
| 2014 | The Mondshein Sequence. | Jens M. Schmidt |
| 2014 | Pseudorandom Graphs in Data Structures. | Omer Reingold, Ron D. Rothblum, Udi Wieder |
| 2014 | A Faster Parameterized Algorithm for Treedepth. | Felix Reidl, Peter Rossmanith, Fernando Snchez Villaamil, Somnath Sikdar |
| 2014 | Secure Computation Using Leaky Tokens. | Manoj Prabhakaran, Amit Sahai, Akshay Wadia |
| 2014 | Going Higher in the First-Order Quantifier Alternation Hierarchy on Words. | Thomas Place, Marc Zeitoun |
| 2014 | Bypassing Erdős' Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. | Merav Parter |
| 2014 | Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences. | Jol Ouaknine, James Worrell |
| 2014 | On the Positivity Problem for Simple Linear Recurrence Sequences, . | Jol Ouaknine, James Worrell |
| 2014 | On Input Indistinguishable Proof Systems. | Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti |
| 2014 | The Melbourne Shuffle: Improving Oblivious Storage in the Cloud. | Olga Ohrimenko, Michael T. Goodrich, Roberto Tamassia, Eli Upfal |
| 2014 | Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems. | Afshin Nikzad, R. Ravi |
| 2014 | Lower Bounds for Oblivious Subspace Embeddings. | Jelani Nelson, Huy L. Nguyn |
| 2014 | Determining Majority in Networks with Local Interactions and Very Small Local Memory. | George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
| 2014 | Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). | Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum |
| 2014 | Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus. | Damiano Mazza |
| 2014 | Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability. | Laura Mancinska, Thomas Vidick |
| 2014 | Precedence-Constrained Scheduling of Malleable Jobs with Preemption. | Konstantin Makarychev, Debmalya Panigrahi |
| 2014 | Nonuniform Graph Partitioning with Unrelated Weights. | Konstantin Makarychev, Yury Makarychev |
| 2014 | FPTAS for Weighted Fibonacci Gates and Its Applications. | Pinyan Lu, Menghui Wang, Chihao Zhang |
| 2014 | Parameterized Approximation Schemes Using Graph Widths. | Michael Lampis |
| 2014 | Testing Forest-Isomorphism in the Adjacency List Model. | Mitsuru Kusumoto, Yuichi Yoshida |