J. ACM

Keyphrases

Publications

volume 71, number 1, 2024

volume 71, number 2, 2024

Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, Ellen Vitercik
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization. J. ACM 71 (2) (2024)
Moritz Lichter, Pascal Schweitzer
Choiceless Polynomial Time with Witnessed Symmetric Choice. J. ACM 71 (2) (2024)
Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy
Sketching Approximability of All Finite CSPs. J. ACM 71 (2) (2024)
Vincent Cohen-Addad, Debarati Das, Evangelos Kipouridis, Nikos Parotsidis, Mikkel Thorup
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor. J. ACM 71 (2) (2024)
Shang-En Huang, Seth Pettie, Leqi Zhu
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection. J. ACM 71 (2) (2024)
Mahmoud Abo Khamis, Hung Q. Ngo, Reinhard Pichler, Dan Suciu, Yisu Remy Wang
Convergence of datalog over (Pre-) Semirings. J. ACM 71 (2) (2024)
Yuqing Kong
Dominantly Truthful Peer Prediction Mechanisms with a Finite Number of Tasks. J. ACM 71 (2) (2024)
Vincent Neiger, Bruno Salvy, Éric Schost, Gilles Villard
Faster Modular Composition. J. ACM 71 (2) (2024)
Arthur Oliveira Vale, Zhong Shao, Yixuan Chen
A Compositional Theory of Linearizability. J. ACM 71 (2) (2024)
Javier Esparza, Rubén Rubio, Salomon Sickert
Efficient Normalization of Linear Temporal Logic. J. ACM 71 (2) (2024)

volume 71, number 3, 2024

Édouard Bonnet, Ugo Giocanti, Patrice Ossona de Mendez, Pierre Simon, Stéphan Thomassé, Szymon Torunczyk
Twin-Width IV: Ordered Graphs and Matrices. J. ACM 71 (3) (2024)
Takashi Yamakawa, Mark Zhandry
Verifiable Quantum Advantage without Structure. J. ACM 71 (3) (2024)
Vishwas Bhargava, Sumanta Ghosh, Zeyu Guo, Mrinal Kumar, Chris Umans
Fast Multivariate Multipoint Evaluation over All Finite Fields. J. ACM 71 (3) (2024)
Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport
Smoothed Analysis of Information Spreading in Dynamic Networks. J. ACM 71 (3) (2024)
Noga Ron-Zewi, Ron Rothblum
Local Proofs Approaching the Witness Length. J. ACM 71 (3) (2024)
Nika Haghtalab, Tim Roughgarden, Abhishek Shetty
Smoothed Analysis with Adaptive Adversaries. J. ACM 71 (3) (2024)
Itai Dinur, Nathan Keller, Ohad Klein
-XOR. J. ACM 71 (3) (2024)
Jason M. Altschuler, Sinho Chewi
Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts. J. ACM 71 (3) (2024)

volume 71, number 4, 2024

volume 70, number 3, 2023

Ho-Lin Chen, David Doty, Wyatt Reeves, David Soloveichik
Rate-independent Computation in Continuous Chemical Reaction Networks. J. ACM 70 (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)
Christoph Berkholz, Jakob Nordström
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. J. ACM 70 (5) (2023)
Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris
Exponentially Faster Massively Parallel Maximal Matching. J. ACM 70 (5) (2023)
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly, James Worrell
On Strongest Algebraic Program Invariants. 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)
Jean Goubault-Larrecq, Xiaodong Jia, Clément Théron
A Domain-theoretic Approach to Statistical Programming Languages. 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)

volume 70, number 6, 2023