Journal of the ACM, Volume 63

Volume 63, Number 1, March 2016

Communication Complexity

• 
  Shachar Lovett:
  Communication is Bounded by Root of Rank. 1:1-1:9

Approximation Algorithms

• 
  Tobias Mömke, Ola Svensson:
  Removing and Adding Edges for the Traveling Salesman Problem. 2:1-2:28

Parallel Computing

• 
  Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Michele Scquizzato, Francesco Silvestri:
  Network-Oblivious Algorithms. 3:1-3:36

Word Equations

• 
  Artur Jez:
  Recompression: A Simple and Powerful Technique for Word Equations. 4:1-4:51

Economics and Computation

• 
  Shahar Dobzinski, Jan Vondrák:
  Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations. 5:1-5:19

Algorithms & Data Structures

• 
  Pierre Fraigniaud, Amos Korman:
  An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. 6:1-6:31

Database Systems & Theory

• 
  Floris Geerts, Thomas Unger, Grigoris Karvounarakis, Irini Fundulaki, Vassilis Christophides:
  Algebraic Structures for Capturing the Provenance of SPARQL Queries. 7:1-7:63

Invited Articles Section

• 
  Éva Tardos:
  Invited Articles Foreword. 8:1

Concurrent, Distributed, and Parallel Languages

• 
  Kohei Honda, Nobuko Yoshida, Marco Carbone:
  Multiparty Asynchronous Session Types. 9:1-9:67

Computer-aided Verification

• 
  Javier Esparza, Pierre Ganty, Rupak Majumdar:
  Parameterized Verification of Asynchronous Shared-Memory Systems. 10:1-10:48

Volume 63, Number 2, May 2016

Economics and Computation

• 
  George Christodoulou, Annamária Kovács, Michael Schapira:
  Bayesian Combinatorial Auctions. 11:1-11:19

Analysis of Algorithms

• 
  Sanjeev Arora, Satyen Kale:
  A Combinatorial, Primal-Dual Approach to Semidefinite Programs. 12:1-12:35

Distributed Computing

• 
  Valerie King, Jared Saia:
  Byzantine Agreement in Expected Polynomial Time. 13:1-13:21

Database Systems and Theory

• 
  Leonid Libkin, Wim Martens, Domagoj Vrgoc:
  Querying Graphs with Data. 14:1-14:53

Complexity Theory

• 
  Reid Andersen, Shayan Oveis Gharan, Yuval Peres, Luca Trevisan:
  Almost Optimal Local Graph Clustering Using Evolving Sets. 15:1-15:31
• 
  Alexander A. Razborov:
  A New Kind of Tradeoffs in Propositional Proof Complexity. 16:1-16:14

Distributed Algorithms

• 
  Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer:
  Local Computation: Lower and Upper Bounds. 17:1-17:44

Invited Articles Section

• 
  Éva Tardos:
  Invited Articles Foreword. 18:1

Logic and Computation

• 
  Christian Herrmann, Martin Ziegler:
  Computational Complexity of Quantum Satisfiability. 19:1-19:31

Volume 63, Number 3, September 2016

Distributed Computing

• 
  Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider:
  The Locality of Distributed Symmetry Breaking. 20:1-20:45

Learning Theory

• 
  Shay Moran, Amir Yehudayoff:
  Sample Compression Schemes for VC Classes. 21:1-21:10

Probabilistic Algorithms

• 
  Dimitris Achlioptas, Fotis Iliopoulos:
  Random Walks That Find Perfect Objects and the Lovász Local Lemma. 22:1-22:29

Number-theoretic Computation

• 
  Ventsislav Chonev, Joël Ouaknine, James Worrell:
  On the Complexity of the Orbit Problem. 23:1-23:18

Computer-aided Verification

• 
  Shaull Almagor, Udi Boker, Orna Kupferman:
  Formally Reasoning About Quality. 24:1-24:56

Logic and Computation

• 
  Murdoch James Gabbay:
  Semantics Out of Context: Nominal Absolute Denotations for First-Order Logic and Computation. 25:1-25:66

Randomized Algorithms and Probabilistic Analysis

• 
  Bernhard Haeupler:
  Analyzing Network Coding (Gossip) Made Easy. 26:1-26:22

Invited Articles Section

• 
  Éva Tardos:
  Invited Articles Foreword. 27e:1

Complexity

• 
  Siu On Chan:
  Approximation Resistance from Pairwise-Independent Subgroups. 27:1-27:32

Computational Biology

• 
  Jesper Jansson, Chuanqi Shen, Wing-Kin Sung:
  Improved Algorithms for Constructing Consensus Trees. 28:1-28:24

Volume 63, Number 4, November 2016

Parameterized and Exact Algorithms

• 
  Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
  Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. 29:1-29:60

Economics and Computation

• 
  Shaddin Dughmi, Tim Roughgarden, Qiqi Yan:
  Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding. 30:1-30:33

Distributed Computing

• 
  Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
  Are Lock-Free Concurrent Algorithms Practically Wait-Free? 31:1-31:20

Probabilistic Proofs

• 
  Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth:
  Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. 32:1-32:57

Quantum Information

• 
  Carl A. Miller, Yaoyun Shi:
  Robust Protocols for Securely Expanding Randomness and Distributing Keys Using Untrusted Quantum Devices. 33:1-33:63

Complexity Theory

• 
  Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
  Approximate Constraint Satisfaction Requires Large LP Relaxations. 34:1-34:22

Coding Theory

• 
  Venkatesan Guruswami, Adam D. Smith:
  Optimal Rate Code Constructions for Computationally Simple Channels. 35:1-35:37

Economics and Computation

• 
  Yakov Babichenko:
  Query Complexity of Approximate Nash Equilibria. 36:1-36:24

Constraint Satisfaction & Computational Complexity

• 
  Johan Thapper, Stanislav Zivný:
  The Complexity of Finite-Valued CSPs. 37:1-37:33

Invited Articles Foreword

• 
  Invited Paper Foreword. 38:1

Communication Complexity

• 
  Zeev Dvir, Sivakanth Gopi:
  2-Server PIR with Subpolynomial Communication. 39:1-39:15

Volume 63, Number 5, December 2016

Graph Theory

• 
  Chandra Chekuri, Julia Chuzhoy:
  Polynomial Bounds for the Grid-Minor Theorem. 40:1-40:65

Algorithms 8 Data Structures

• 
  Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck:
  Highway Dimension and Provably Efficient Shortest Path Algorithms. 41:1-41:26

Randomized Algorithms 8 Probabilistic Combinatorics

• 
  Benjamin Doerr, Carola Doerr, Reto Spöhel, Henning Thomas:
  Playing Mastermind With Many Colors. 42:1-42:23

Probabilistic Combinations

• 
  Heidi Gebauer, Tibor Szabó, Gábor Tardos:
  The Local Lemma Is Asymptotically Tight for SAT. 43:1-43:32

Parameterized Complexity, Graph Algorithms, Monadic Second-order Logic

• 
  Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
  (Meta) Kernelization. 44:1-44:69

Invited Articles

• 
  Éva Tardos:
  Invited Articles Foreword. 45e:1

Graph Algorithms

• 
  Julia Chuzhoy, Shi Li:
  A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2. 45:1-45:51

Computational Complexity

• 
  Anat Ganor, Gillat Kol, Ran Raz:
  Exponential Separation of Information and Communication for Boolean Functions. 46:1-46:31

Distributed Computing

• 
  Leonid Barenboim:
  Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks. 47:1-47:22

Volume 63, Number 6, January 2017

Computational Geometry

• 
  Mohab Safey El Din, Éric Schost:
  A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets. 48:1-48:37

Randomized Algorithms & Probabilistic Analysis

• 
  Amin Coja-Oghlan:
  Belief Propagation Guided Decimation Fails on Random Formulas. 49:1-49:55

Machine Learning

• 
  Pranjal Awasthi, Maria-Florina Balcan, Philip M. Long:
  The Power of Localization for Efficiently Learning Linear Separators with Noise. 50:1-50:27

Algebraic Computation

• 
  David Harvey, Joris van der Hoeven, Grégoire Lecerf:
  Faster Polynomial Multiplication over Finite Fields. 52:1-52:23