| 2014 | Verifying and Synthesizing Software with Recursive Functions - (Invited Contribution). | Viktor Kuncak |
| 2014 | Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits. | Mrinal Kumar, Shubhangi Saraf |
| 2014 | Coloring Relatives of Interval Overlap Graphs via On-line Games. | Tomasz Krawczyk, Bartosz Walczak |
| 2014 | Kleene Algebra with Equations. | Dexter Kozen, Konstantinos Mamouras |
| 2014 | Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router. | Adrian Kosowski, Dominik Pajak |
| 2014 | Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields. | Swastik Kopparty, Mrinal Kumar, Michael E. Saks |
| 2014 | Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. | Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon |
| 2014 | Distance Oracles for Time-Dependent Networks. | Spyros C. Kontogiannis, Christos D. Zaroliagis |
| 2014 | Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound. | Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff |
| 2014 | An Improved Interactive Streaming Algorithm for the Distinct Elements Problem. | Hartmut Klauck, Ved Prakash |
| 2014 | Stability and Complexity of Minimising Probabilistic Automata. | Stefan Kiefer, Bjrn Wachter |
| 2014 | The Complexity of Somewhat Approximation Resistant Predicates. | Subhash Khot, Madhur Tulsiani, Pratik Worah |
| 2014 | Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems. | Erez Kantor, Shay Kutten |
| 2014 | Monodic Fragments of Probabilistic First-Order Logic. | Jean Christoph Jung, Carsten Lutz, Sergey Goncharov, Lutz Schrder |
| 2014 | Context Unification is in PSPACE. | Artur Jez |
| 2014 | Bisimulation Equivalence of First-Order Grammars. | Petr Jancar |
| 2014 | Information Theoretical Cryptogenography. | Sune K. Jakobsen |
| 2014 | Between Linearizability and Quiescent Consistency - Quantitative Quiescent Consistency. | Radha Jagadeesan, James Riely |
| 2014 | On the Complexity of Trial and Error for Constraint Satisfaction Problems. | Gbor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram |
| 2014 | Partial Garbling Schemes and Their Applications. | Yuval Ishai, Hoeteck Wee |
| 2014 | Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. | John Iacono, zgr zkan |
| 2014 | Privately Solving Linear Programs. | Justin Hsu, Aaron Roth, Tim Roughgarden, Jonathan R. Ullman |
| 2014 | How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. | Wiebke Hhn, Julin Mestre, Andreas Wiese |
| 2014 | Piecewise Boolean Algebras and Their Domains. | Chris Heunen |
| 2014 | Breaking the PPSZ Barrier for Unique 3-SAT. | Timon Hertli |