Journal of the ACM, Volume 69

Volume 69, Number 1, February 2022

Complexity Theory

• 
  Yael Tauman Kalai, Ran Raz, Ron D. Rothblum:
  How to Delegate Computations: The Power of No-Signaling Proofs. 1:1-1:82

Algorithms and Data Structure

• 
  Anupam Gupta, David G. Harris, Euiwoong Lee, Jason Li:
  Optimal Bounds for the k-cut Problem. 2:1-2:18

Algorithmic Graph Theory

• 
  Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
  Twin-width I: Tractable FO Model Checking. 3:1-3:46

Computational Geometry

• 
  Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow:
  The Art Gallery Problem is ∃ℝ-complete. 4:1-4:70

Distributed Computing

• 
  Leonid Barenboim, Michael Elkin, Uri Goldenberg:
  Locally-iterative Distributed (Δ + 1)-coloring and Applications. 5:1-5:26

Database Systems and Theory

• 
  Mark Kaminski, Egor V. Kostylev, Bernardo Cuenca Grau, Boris Motik, Ian Horrocks:
  The Complexity and Expressive Power of Limit Datalog. 6:1-6:83

Invited Article Foreword

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

Logic and Computation

• 
  Abbas Edalat:
  Smooth Approximation of Lipschitz Maps and Their Subgradients. 8:1-8:32

Volume 69, Number 2, April 2022

Complexity Theory

• 
  Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan:
  Fooling Polytopes. 9:1-9:37

Algorithmic Coding Theory

• 
  Venkatesan Guruswami, Chaoping Xing:
  Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes. 10:1-10:48

Coding Theory and Complexity

• 
  Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
  General Strong Polarization. 11:1-11:67

Algebraic Algorithms

• 
  David Harvey, Joris van der Hoeven:
  Polynomial Multiplication over Finite Fields in Time \( O (n \log n) \). 12:1-12:40

Algorithmic Graph Theory

• 
  Radoslav Fulek, Csaba D. Tóth:
  Atomic Embeddability, Clustered Planarity, and Thickenability. 13:1-13:34

Logic and Computation

• 
  Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
  String Diagram Rewrite Theory I: Rewriting with Frobenius Structure. 14:1-14:58

Quantum Computing

• 
  Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner:
  Spatial Isolation Implies Zero Knowledge Even in a Quantum World. 15:1-15:44

Invited Article Foreword

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

Streaming Algorithms

• 
  Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev:
  A Framework for Adversarially Robust Streaming Algorithms. 17:1-17:33

Volume 69, Number 3, June 2022

Algebraic Complexity

• 
  Pranjal Dutta, Nitin Saxena, Amit Sinhababu:
  Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring. 18:1-18:39

Computational Complexity

• 
  Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
  Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. 19:1-19:32

Artificial Intelligence

• 
  Matvey Soloviev, Joseph Y. Halpern:
  Information Acquisition Under Resource Limitations in a Noisy Environment. 20:1-20:37

Machine Learning and Optimization

• 
  Eric Balkanski, Aviad Rubinstein, Yaron Singer:
  The Limitations of Optimization from Samples. 21:1-21:33

Database Theory

• 
  Nicole Schweikardt, Luc Segoufin, Alexandre Vigny:
  Enumeration for FO Queries over Nowhere Dense Graphs. 22:1-22:37

Algorithms and Data Structures

• 
  Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira:
  Counting Subgraphs in Degenerate Graphs. 23:1-23:21

Volume 69, Number 4, August 2022

Distributed Computing

• 
  Gadi Taubenfeld:
  Anonymous Shared Memory. 24:1-24:30

Comutational Complexity

• 
  Lijie Chen, Shuichi Hirahara, Igor Carboni Oliveira, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
  Beyond Natural Proofs: Hardness Magnification and Locality. 25:1-25:49

Coding Theory, Complexity Theory

• 
  Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew:
  Optimal Short-Circuit Resilient Formulas. 26:1-26:37

Security and Privacy

• 
  T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
  Foundations of Differentially Oblivious Algorithms. 27:1-27:49

Machine Learning

• 
  Noga Alon, Mark Bun, Roi Livni, Maryanthe Malliaris, Shay Moran:
  Private and Online Learnability Are Equivalent. 28:1-28:34

Distributed Computing

• 
  Michal Dory, Merav Parter:
  Exponentially Faster Shortest Paths in the Congested Clique. 29:1-29:42

Quantum Query Complexity

• 
  Ran Raz, Avishay Tal:
  Oracle Separation of BQP and PH. 30:1-30:21

Volume 69, Number 5, October 2022

Cryptography

• 
  Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
  SPARKs: Succinct Parallelizable Arguments of Knowledge. 31:1-31:88

Computational Geometry

• 
  Natan Rubin:
  An Improved Bound for Weak Epsilon-nets in the Plane. 32:1-32:35

Quntaum Computing

• 
  Nai-Hui Chia, András Pal Gilyén, Tongyang Li, Han-Hsuan Lin, Ewin Tang, Chunhao Wang:
  Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning. 33:1-33:72

Distributed computing

• 
  Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers:
  Decentralized Asynchronous Crash-resilient Runtime Verification. 34:1-34:31

Complexity Theory

• 
  Dmitriy Zhuk, Barnaby Martin:
  QCSP Monsters and the Demise of the Chen Conjecture. 35:1-35:44

Cryptography

• 
  Sanjam Garg, Akshayaram Srinivasan:
  Two-round Multiparty Secure Computation from Minimal Assumptions. 36:1-36:30

INVITED ARTICLE: Database Systems and Theory

• 
  Martin Grohe, Peter Lindner:
  Independence in Infinite Probabilistic Databases. 37:1-37:42

INVITED ARTICLE: Programming languages

• 
  Elizabeth Labrada, Matías Toro, Éric Tanter:
  Gradual System F. 38:1-38:78

Volume 69, Number 6, December 2022

Computational Learning Theory

• 
  Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan:
  Properly Learning Decision Trees in almost Polynomial Time. 39:1-39:19

Online Algorithms

• 
  Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins:
  Adversarial Bandits with Knapsacks. 40:1-40:47

Algorithmic Game Theory

• 
  Gabriele Farina, Andrea Celli, Alberto Marchesi, Nicola Gatti:
  Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium. 41:1-41:41

Streaming Algorithms

• 
  Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Yossi Matias, Uri Stemmer:
  Adversarially Robust Streaming Algorithms via Differential Privacy. 42:1-42:14

Computational Complexity

• 
  Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman:
  Nearly Optimal Pseudorandomness from Hardness. 43:1-43:55

Error-correcting Codes

• 
  Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu:
  Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors. 44:1-44:39

INVITED ARTICLE: Online Algorithms

• 
  Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam:
  Edge-Weighted Online Bipartite Matching. 45:1-45:35

INVITED ARTICLE: Database Theory

• 
  Martin Grohe, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Peter Lindner:
  Generative Datalog with Continuous Distributions. 46:1-46:52