| 0 | -- | 0 | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time |
| 0 | -- | 0 | Konstantin Makarychev, Maxim Sviridenko. Solving Optimization Problems with Diseconomies of Scale via Decoupling |
| 0 | -- | 0 | Armando Castañeda, Sergio Rajsbaum, Michel Raynal. Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability |
| 0 | -- | 0 | Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang. Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation) |
| 0 | -- | 0 | Moshe Babaioff, Nicole Immorlica, David Kempe 0001, Robert Kleinberg. Matroid Secretary Problems |
| 0 | -- | 0 | Xi Chen 0001, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie. Settling the Query Complexity of Non-adaptive Junta Testing |
| 0 | -- | 0 | Stephan Friedrichs, Christoph Lenzen. Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford |
| 0 | -- | 0 | Nir Bitansky, Vinod Vaikuntanathan. Indistinguishability Obfuscation from Functional Encryption |
| 0 | -- | 0 | Éva Tardos. Invited Article Foreword |
| 0 | -- | 0 | Joshua A. Grochow, Toniann Pitassi. Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System |
| 0 | -- | 0 | James Aspnes, Hagit Attiya, Keren Censor Hillel, Faith Ellen. Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity |