Journal of the ACM, Volume 70

Volume 70, Number 1, February 2023

• 
  Joachim Kock:
  Whole-grain Petri Nets and Processes. 1:1-1:58
• 
  Manuel Bodirsky, Jakub Rydval:
  On the Descriptive Complexity of Temporal Constraint Satisfaction Problems. 2:1-2:58
• 
  James B. Orlin, László A. Végh:
  Directed Shortest Paths via Approximate Cost Balancing. 3:1-3:33
• 
  Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
  OptORAMa: Optimal Oblivious RAM. 4:1-4:70
• 
  Haotian Jiang:
  Minimizing Convex Functions with Rational Minimizers. 5:1-5:27
• 
  Nai-Hui Chia, Kai-Min Chung, Ching-Yi Lai:
  On the Need for Large Quantum Depth. 6:1-6:38
• 
  John Fearnley, Paul Goldberg, Alexandros Hollender, Rahul Savani:
  The Complexity of Gradient Descent: CLS = PPAD ∩ PLS. 7:1-7:74
• 
  Xavier Goaoc, Emo Welzl:
  Convex Hulls of Random Order Types. 8:1-8:47

Volume 70, Number 2, April 2023

• 
  Bruno Bauwens, Marius Zimand:
  Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time. 9:1-9:33
• 
  Sébastien Bubeck, Mark Sellke:
  A Universal Law of Robustness via Isoperimetry. 10:1-10:18
• 
  Haitao Wang:
  A New Algorithm for Euclidean Shortest Paths in the Plane. 11:1-11:62
• 
  Panagiotis Charalampopoulos, Pawel Gawrychowski, Yaowei Long, Shay Mozes, Seth Pettie, Oren Weimann, Christian Wulff-Nilsen:
  Almost Optimal Exact Distance Oracles for Planar Graphs. 12:1-12:50
• 
  Ivan Geffner, Joseph Y. Halpern:
  Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents. 13:1-13:21
• 
  Moritz Lichter:
  Separating Rank Logic from Polynomial Time. 14:1-14:53
• 
  Roberto Bruni, Roberto Giacobazzi, Roberta Gori, Francesco Ranzato:
  A Correctness and Incorrectness Program Logic. 15:1-15:45
• 
  Peyman Afshani, Pingan Cheng:
  Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. 16:1-16:26
• 
  Arik Rinberg, Idit Keidar:
  Intermediate Value Linearizability: A Quantitative Correctness Criterion. 17:1-17:21

Volume 70, Number 3, June 2023

• 
  Daniel Rutschmann, Manuel Wettstein:
  Chains, Koch Chains, and Point Sets with Many Triangulations. 18:1-18:26
• 
  Meena Jagadeesan, Alexander Wei, Yixin Wang, Michael I. Jordan, Jacob Steinhardt:
  Learning Equilibria in Matching Markets with Bandit Feedback. 19:1-19:46
• 
  Jason Gaitonde, Éva Tardos:
  The Price of Anarchy of Strategic Queuing Systems. 20:1-20:63
• 
  Allen Liu, Ankur Moitra:
  Robustly Learning General Mixtures of Gaussians. 21:1-21:53
• 
  Ho-Lin Chen, David Doty, Wyatt Reeves, David Soloveichik:
  Rate-independent Computation in Continuous Chemical Reaction Networks. 22:1-22:61
• 
  Laurent Doyen:
  Stochastic Games with Synchronization Objectives. 23:1-23:35

Volume 70, Number 4, August 2023

INVITED ARTICLE: Algorithms and Data Structures

• 
  Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
  The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. 24:1-24:52

INVITED ARTICLE: Computational Complexity

• 
  Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
  On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. 25:1-25:62

INVITED ARTICLE: Algebraic Complexity and Algorithms

• 
  Ventsislav Chonev, Joël Ouaknine, James Worrell:
  On the Zeros of Exponential Polynomials. 26:1-26:26

Automata and Formal Languages

• 
  Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti, Nicola Prezza:
  Co-lexicographically Ordering Automata and Regular Languages - Part I. 27:1-27:73

Volume 70, Number 5, October 2023

INVITED ARTICLE: Distributed Computing

• 
  Greg Bodwin, Merav Parter:
  Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. 28:1-28:24

INVITED ARTICLE: Logic and Computation

• 
  Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell:
  On Strongest Algebraic Program Invariants. 29:1-29:22

INVITED ARTICLE: Relative Error Streaming Quantiles

• 
  Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý:
  Relative Error Streaming Quantiles. 30:1-30:48

Coding Theory

• 
  Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
  Proximity Gaps for Reed-Solomon Codes. 31:1-31:57

Logic and Computation

• 
  Christoph Berkholz, Jakob Nordström:
  Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. 32:1-32:32
• 
  Alexandru Baltag, Nick Bezhanishvili, David Fernández-Duque:
  The Topological Mu-Calculus: Completeness and Decidability. 33:1-33:38

Parallel and Distributed Algorithms

• 
  Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
  Exponentially Faster Massively Parallel Maximal Matching. 34:1-34:18

Programming Languages

• 
  Jean Goubault-Larrecq, Xiaodong Jia, Clément Théron:
  A Domain-theoretic Approach to Statistical Programming Languages. 35:1-35:63

Algorithmic Game Theory

• 
  Yaonan Jin, Pinyan Lu:
  First Price Auction is 1-1/e² Efficient. 36:1-36:86

Volume 70, Number 6, December 2023

INVITED ARTICLE: Online Algorithms

• 
  Dimitrios Los, Thomas Sauerwald:
  Balanced Allocations with the Choice of Noise. 37:1-37:84

INVITED ARTICLE: Analysis of Algorithms

• 
  Shalev Ben-David, Eric Blais:
  A New Minimax Theorem for Randomized Algorithms. 38:1-38:58

Algorithms and Data Structures

• 
  Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
  Toward a Better Understanding of Randomized Greedy Matching. 39:1-39:32
• 
  Michael A. Bender, Alex Conway, Martin Farach-Colton, William Kuszmaul, Guido Tagliavini:
  Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once. 40:1-40:51
• 
  Miguel Romero, Marcin Wrochna, Stanislav Zivný:
  Pliability and Approximating Max-CSPs. 41:1-41:43

Algebraic Computation and Complexity

• 
  Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra:
  Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. 42:1-42:46