Journal of the ACM, Volume 67

Volume 67, Number 1, March 2020

Scientific and High Performance Computing

• 
  Elaye Karstadt, Oded Schwartz:
  Matrix Multiplication, a Little Faster. 1:1-1:31

Design and analysis of algorithms

• 
  Travis Gagie, Gonzalo Navarro, Nicola Prezza:
  Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space. 2:1-2:54

Distributed Computing

• 
  Guy Goren, Yoram Moses:
  Silence. 3:1-3:26

Database Systems and Theory

• 
  Paolo Ciaccia, Davide Martinenghi, Riccardo Torlone:
  Foundations of Context-aware Preference Propagation. 4:1-4:43

Graph Algorithms

• 
  Maria Chudnovsky, Alex Scott, Paul D. Seymour, Sophie Spirkl:
  Detecting an Odd Hole. 5:1-5:12

Logic in Computer Science

• 
  André Platzer, Yong Kiam Tan:
  Differential Equation Invariance Axiomatization. 6:1-6:66

Approximation Algorithms

• 
  Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi:
  Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency. 7:1-7:33

Volume 67, Number 2, May 2020

Algebraic Complexity Theory

• 
  Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
  Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree. 8:1-8:28

Proof Complexity

• 
  Olaf Beyersdorff, Ilario Bonacina, Leroy Chew, Ján Pich:
  Frege Systems for Quantified Boolean Logic. 9:1-9:36

Algorithms

• 
  Neil Olver, László A. Végh:
  A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. 10:1-10:26

Distributed Computing

• 
  Dariusz R. Kowalski, Miguel A. Mosteiro:
  Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations. 11:1-11:17

Invited Paper Foreword

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

Distributed Computing

• 
  Michael Elkin:
  A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities. 13:1-13:15

Volume 67, Number 3, June 2020

Distributed Computing, Parameterized Complexity Theory, Randomized Algorithms, and Computational Geometry
Distributed Computing

• 
  Laasya Bangalore, Ashish Choudhury, Arpita Patra:
  The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. 14:1-14:59
• 
  Michael Elkin:
  Distributed Exact Shortest Paths in Sublinear Time. 15:1-15:36

Parametized Complexity Theory

• 
  Stefan Kratsch, Magnus Wahlström:
  Representative Sets and Irrelevant Vertices: New Tools for Kernelization. 16:1-16:50

Randomized Algorithms

• 
  Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu:
  Fully Online Matching. 17:1-17:25

Computational Geometry

• 
  Sharath Raghvendra, Pankaj K. Agarwal:
  A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching. 18:1-18:19

Volume 67, Number 4, August 2020

Computer Vision

• 
  Jeroen Chua, Pedro F. Felzenszwalb:
  Scene Grammars, Factor Graphs, and Belief Propagation. 19:1-19:41

Computational Topology

• 
  Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer:
  Embeddability in R³ is NP-hard. 20:1-20:29

Algorithms and Data Structures

• 
  Nima Anari, Vijay V. Vazirani:
  Planar Graph Perfect Matching Is in NC. 21:1-21:34

Graph Theory

• 
  Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
  Planar Graphs Have Bounded Queue-Number. 22:1-22:38

Computational Complexity Theory

• 
  Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif:
  The Log-Approximate-Rank Conjecture Is False. 23:1-23:28

Economics and Computation

• 
  Moshe Babaioff, Nicole Immorlica, Brendan Lucier, S. Matthew Weinberg:
  A Simple and Approximately Optimal Mechanism for an Additive Buyer. 24:1-24:40

Logic and Computation

• 
  Daniel Gaina:
  Forcing and Calculi for Hybrid Logics. 25:1-25:55

Volume 67, Number 5, October 2020

Economics and Computation

• 
  Miroslav Dudík, Nika Haghtalab, Haipeng Luo, Robert E. Schapire, Vasilis Syrgkanis, Jennifer Wortman Vaughan:
  Oracle-efficient Online Learning and Auction Design. 26:1-26:57

Parallel Algorithms

• 
  Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
  Parallelism in Randomized Incremental Algorithms. 27:1-27:27

Cryptography

• 
  Ran Canetti:
  Universally Composable Security. 28:1-28:94

Invited Papers Foreword

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

Complexity Theory

• 
  Dmitriy Zhuk:
  A Proof of the CSP Dichotomy Conjecture. 30:1-30:78

Logic and Computation

• 
  Albert Atserias, Moritz Müller:
  Automating Resolution is NP-Hard. 31:1-31:17

Volume 67, Number 6, November 2020

Machine Learning

• 
  Hassan Ashtiani, Shai Ben-David, Nicholas J. A. Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan:
  Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes. 32:1-32:42

Logic in Computer Science

• 
  Javier Esparza, Jan Kretínský, Salomon Sickert:
  A Unified Translation of Linear Temporal Logic to ω-Automata. 33:1-33:61

Database System and Theory

• 
  Pablo Barceló, Diego Figueira, Georg Gottlob, Andreas Pieris:
  Semantic Optimization of Conjunctive Queries. 34:1-34:60

Invited Articles Foreword

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

Approximation Algorithms

• 
  Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks:
  Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. 36:1-36:22

Algorithms

• 
  Ola Svensson, Jakub Tarnawski, László A. Végh:
  A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. 37:1-37:53
• 
  Michel X. Goemans, Thomas Rothvoss:
  Polynomiality for Bin Packing with a Constant Number of Item Types. 38:1-38:21