Journal of the ACM, Volume 64

Volume 64, Number 1, March 2017

Computational Geometry

• 
  Rowan Davies:
  A Temporal Logic Approach to Binding-Time Analysis. 1:1-1:45

Network Algorthims, Network Resources Allocation

• 
  Emilie Danna, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Yishay Mansour, Danny Raz, Michal Segalov:
  Upward Max-Min Fairness. 2:1-2:24

Computational Geometry

• 
  Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
  Instance-Optimal Geometric Algorithms. 3:1-3:38

Approximation Algorithms

• 
  Ken-ichi Kawarabayashi, Mikkel Thorup:
  Coloring 3-Colorable Graphs with Less than n^1/5 Colors. 4:1-4:23

Randomized Algorithms 8 Probabilistic Analysis

• 
  Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, David Richerby:
  Amplifiers for the Moran Process. 5:1-5:90

Invited Article

• 
  Éva Tardos:
  Invited Article Foreword. 6:1

Formal Methods: Computer-aided Verification

• 
  Aleksandr Karbyshev, Nikolaj S. Bjørner, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham:
  Property-Directed Inference of Universal Invariants or Proving Their Absence. 7:1-7:33

Volume 64, Number 2, June 2017

Design 8 Analysis of Algorithms and/or Randomness

• 
  Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao:
  Statistical Algorithms and a Lower Bound for Detecting Planted Cliques. 8:1-8:37

Numerical Algorithms

• 
  Leonard J. Schulman, Alistair Sinclair:
  Analysis of a Classical Matrix Preconditioning Algorithm. 9:1-9:23

Cryptography

• 
  Benny Applebaum, Jonathan Avron, Chris Brzuska:
  Arithmetic Cryptography. 10:1-10:74

Coding Theory, Property Testing

• 
  Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
  High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. 11:1-11:42

Randomized Algorithms and Probabilistic Analysis

• 
  Martin E. Dyer, Mark Jerrum, Haiko Müller:
  On the Switch Markov Chain for Perfect Matchings. 12:1-12:33

Invited Articles

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

Logic in Computer Science; Computer-aided Verification

• 
  Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
  Monadic Decomposition. 14:1-14:28

Computer-aided Verification, Logic in Computer Science

• 
  Byron Cook, Heidy Khlaaf, Nir Piterman:
  Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems. 15:1-15:39

Volume 64, Number 3, June 2017

Distributed Computing

• 
  Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita:
  Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space. 16:1-16:43

Logic, Algorithms & Complexity

• 
  Martin Grohe, Stephan Kreutzer, Sebastian Siebertz:
  Deciding First-Order Properties of Nowhere Dense Graphs. 17:1-17:32

Graph Algorithms

• 
  Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala:
  Tight Lower Bounds on Graph Embedding Problems. 18:1-18:22

Computational Complexity

• 
  Jin-Yi Cai, Xi Chen:
  Complexity of Counting CSP with Complex Weights. 19:1-19:39

Economics & Computation

• 
  Xi Chen, Dimitris Paparas, Mihalis Yannakakis:
  The Complexity of Non-Monotone Markets. 20:1-20:56

Property Testing

• 
  Oded Goldreich, Dana Ron:
  On Learning and Testing Dynamic Environments. 21:1-21:90

Invited Article

• 
  Éva Tardos:
  Invited Article Foreword. 22:1

Distributed Computing

• 
  Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman:
  A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds. 23:1-23:11

Volume 64, Number 4, September 2017

Computational Molecular Biology

• 
  Yu Zheng, Louxin Zhang:
  Reconciliation With Nonbinary Gene Trees Revisited. 24:1-24:28

Computer-aided Verification

• 
  Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas:
  Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. 25:1-25:49

Logic, Algorithms 8 Complexity

• 
  Hubie Chen:
  The Tractability Frontier of Graph-Like First-Order Query Sets. 26:1-26:29

Labeling Schemes

• 
  Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
  Optimal Induced Universal Graphs and Adjacency Labeling for Trees. 27:1-27:22

Graph Algorithms

• 
  Amir Abboud, Greg Bodwin:
  The 4/3 Additive Spanner Exponent Is Tight. 28:1-28:20

Invited Article

• 
  Éva Tardos:
  Invited Article Foreword.

Computational Complexity

• 
  Aaron Potechin:
  Bounds on Monotone Switching Networks for Directed Connectivity. 29:1-29:48

Volume 64, Number 5, October 2017

Decision Theory

• 
  Shipra Agrawal, Navin Goyal:
  Near-Optimal Regret Bounds for Thompson Sampling. 30:1-30:24

Automata Theory

• 
  Rajeev Alur, Loris D'Antoni:
  Streaming Tree Transducers. 31:1-31:55

Computational Complexity

• 
  Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
  Separations in Query Complexity Based on Pointer Functions. 32:1-32:24

Graphic Games

• 
  Nathalie Bertrand, Blaise Genest, Hugo Gimbert:
  Qualitative Determinacy and Decidability of Stochastic Games with Signals. 33:1-33:48

Formal Languages and Automata Theory

• 
  Krishnendu Chatterjee, Yaron Velner:
  The Complexity of Mean-Payoff Pushdown Games. 34:1-34:49

Invited Articles

• 
  Éva Tardos:
  Invited Articles Foreword.

Circuit Complexity

• 
  Johan Håstad, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
  An Average-Case Depth Hierarchy Theorem for Boolean Circuits. 35:1-35:27

Database Systems and Theory

• 
  Tom J. Ameloot, Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
  Parallel-Correctness and Transferability for Conjunctive Queries. 36:1-36:38

Volume 64, Number 6, November 2017

Statistical Estimation

• 
  Gregory Valiant, Paul Valiant:
  Estimating the Unseen: Improved Estimators for Entropy and Other Properties. 37:1-37:41

Analog Computation

• 
  Olivier Bournez, Daniel Silva Graça, Amaury Pouly:
  Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. 38:1-38:76

Fair Division

• 
  Ya'akov (Kobi) Gal, Moshe Mash, Ariel D. Procaccia, Yair Zick:
  Which Is the Fairest (Rent Division) of Them All? 39:1-39:22

Invited Articles

• 
  Éva Tardos:
  Invited Articles Foreword.

Database Systems and Theory

• 
  Paul Beame, Paraschos Koutris, Dan Suciu:
  Communication Steps for Parallel Query Processing. 40:1-40:58

Complexity

• 
  Thomas Rothvoss:
  The Matching Polytope has Exponential Extension Complexity. 41:1-41:19