J. ACM

Keyphrases

Publications

volume 71, number 1, 2024

volume 70, number 1, 2023

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

volume 70, number 2, 2023

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

volume 70, number 3, 2023

volume 70, number 4, 2023

volume 70, number 5, 2023

Greg Bodwin, Merav Parter
Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs. J. ACM 70 (5) (2023)
Jean Goubault-Larrecq, Xiaodong Jia, Clément Théron
A Domain-theoretic Approach to Statistical Programming Languages. J. ACM 70 (5) (2023)
Christoph Berkholz, Jakob Nordström
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. J. ACM 70 (5) (2023)
Alexandru Baltag, Nick Bezhanishvili, David Fernández-Duque
The Topological Mu-Calculus: Completeness and Decidability. J. ACM 70 (5) (2023)
Graham Cormode, Zohar S. Karnin, Edo Liberty, Justin Thaler, Pavel Veselý
Relative Error Streaming Quantiles. J. ACM 70 (5) (2023)
Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris
Exponentially Faster Massively Parallel Maximal Matching. J. ACM 70 (5) (2023)
Yaonan Jin, Pinyan Lu
Efficient. J. ACM 70 (5) (2023)
Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
Proximity Gaps for Reed-Solomon Codes. J. ACM 70 (5) (2023)
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
On Strongest Algebraic Program Invariants. J. ACM 70 (5) (2023)

volume 70, number 6, 2023

volume 69, number 6, 2022

Nicole Immorlica, Karthik Abinav Sankararaman, Robert E. Schapire, Aleksandrs Slivkins
Adversarial Bandits with Knapsacks. J. ACM 69 (6) (2022)
Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan
Properly Learning Decision Trees in almost Polynomial Time. J. ACM 69 (6) (2022)