Journal: Journal of the ACM

Volume 65, Issue 6

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

Volume 65, Issue 5

0 -- 0Bingkai Lin. k-Biclique Problem
0 -- 0Haifeng Yu, Yuda Zhao, Irvan Jahja. The Cost of Unknown Diameter in Dynamic Networks
0 -- 0Samir Datta, Raghav Kulkarni, Anish Mukherjee 0001, Thomas Schwentick, Thomas Zeume. Reachability Is in DynFO
0 -- 0Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev. Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity
0 -- 0James P. Delgrande, Pavlos Peppas, Stefan Woltran. General Belief Revision
0 -- 0Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam. On Algebraic Branching Programs of Small Width
0 -- 0Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo. Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
0 -- 0Virginia Vassilevska Williams, R. Ryan Williams. Subcubic Equivalences Between Path, Matrix, and Triangle Problems

Volume 65, Issue 4

0 -- 0Ethan L. Schreiber, Richard E. Korf, Michael D. Moffitt. Optimal Multi-Way Number Partitioning
0 -- 0Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs. Non-Malleable Codes
0 -- 0Emil Stefanov, Marten van Dijk, Elaine Shi, T.-H. Hubert Chan, Christopher W. Fletcher, Ling Ren 0001, Xiangyao Yu, Srinivas Devadas. Path ORAM: An Extremely Simple Oblivious RAM Protocol
0 -- 0Allan Grønlund, Seth Pettie. Threesomes, Degenerates, and Love Triangles
0 -- 0Éva Tardos. Invited Article Foreword
0 -- 0Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys. Minimization of Tree Patterns
0 -- 0David G. Harris, Johannes Schneider, Hsin-Hao Su. Distributed (Δ +1)-Coloring in Sublogarithmic Rounds
0 -- 0Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, Alessandro Panconesi. Rumor Spreading and Conductance
0 -- 0Thomas Ehrhard, Michele Pagani, Christine Tasson. Full Abstraction for Probabilistic PCF
0 -- 0Helmut Seidl, Sebastian Maneth, Gregor Kemper. Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable

Volume 65, Issue 3

0 -- 0Éva Tardos. Invited Article Foreword
0 -- 0Hung Q. Ngo 0001, Ely Porat, Christopher Ré, Atri Rudra. Worst-case Optimal Join Algorithms
0 -- 0Itay Berman, Iftach Haitner, Aris Tentes. Any Constant Bias Implies One-Way Functions
0 -- 0Marek Cygan, Stefan Kratsch, Jesper Nederlof. Fast Hamiltonicity Checking Via Bases of Perfect Matchings
0 -- 0Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins. Bandits with Knapsacks
0 -- 0T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang. Spectral Properties of Hypergraph Laplacian and Approximation Algorithms

Volume 65, Issue 2

0 -- 0Michael Molloy. k-Colourings of a Random Graph
0 -- 0Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001. Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes
0 -- 0David Kurokawa, Ariel D. Procaccia, Junxing Wang. Fair Enough: Guaranteeing Approximate Maximin Shares
0 -- 0Éva Tardos. Invited Article Foreword
0 -- 0Andrea Cerone, Alexey Gotsman. Analysing Snapshot Isolation
0 -- 0Florian Brandl, Felix Brandt 0001, Manuel Eberl, Christian Geist. Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving
0 -- 0Manuel Bodirsky, Barnaby Martin, Antoine Mottet. Discrete Temporal Constraint Satisfaction Problems

Volume 65, Issue 1

0 -- 0Jirí Matousek, Eric Sedgwick, Martin Tancer, Uli Wagner 0001. Embeddability in the 3-Sphere Is Decidable
0 -- 0Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler. Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
0 -- 0Sungjin Im, Janardhan Kulkarni, Kamesh Munagala. Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints
0 -- 0Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky. Characterizing Transactional Memory Consistency Conditions Using Observational Refinement
0 -- 0Éva Tardos. Invited Article Foreword
0 -- 0Martín Abadi, Bruno Blanchet, Cédric Fournet. The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication