Journal: Journal of the ACM

Volume 71, Issue 6

0 -- 0Yifan Jing, Bojan Mohar. Efficient polynomial-time approximation scheme for the genus of dense graphs
0 -- 0Moses Charikar, Prasanna Ramakrishnan, Kangning Wang 0001, Hongxun Wu. Breaking the Metric Voting Distortion Barrier
0 -- 0Annie Marsden, Vatsal Sharan, Aaron Sidford, Gregory Valiant. Efficient Convex Optimization Requires Superlinear Memory
0 -- 0Amin Timany, Robbert Krebbers, Derek Dreyer, Lars Birkedal. A Logical Approach to Type Soundness
0 -- 0Mladen Miksa, Jakob Nordström. A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds
0 -- 0Thomas Nowak, Ulrich Schmid 0001, Kyrill Winkler. Topological Characterization of Consensus in Distributed Systems

Volume 71, Issue 5

0 -- 0Namiko Matsumoto, Arya Mazumdar. Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
0 -- 0Antoine Mottet, Michael Pinsker. Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures
0 -- 0Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc. Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
0 -- 0Deeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva. p-Regression
0 -- 0Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos. Pure-Circuit: Tight Inapproximability for PPAD
0 -- 0Maria-Florina Balcan, Dan F. DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, Ellen Vitercik. How Much Data Is Sufficient to Learn High-Performing Algorithms?

Volume 71, Issue 4

0 -- 0Juan A. Garay, Aggelos Kiayias, Nikos Leonardos. The Bitcoin Backbone Protocol: Analysis and Applications
0 -- 0Mickaël Buchet, Bianca B. Dornelas, Michael Kerber. Sparse Higher Order Čech Filtrations
0 -- 0Tim Roughgarden. Transaction Fee Mechanism Design
0 -- 0Dimitrios M. Thilikos, Sebastian Wiederrecht. Killing a Vortex
0 -- 0Mika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao 0013. Separations in Proof Complexity and TFNP
0 -- 0Sinho Chewi, Jaume de Dios Pont, Jerry Li 0001, Chen Lu 0002, Shyam Narayanan. Query Lower Bounds for Log-concave Sampling

Volume 71, Issue 3

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

Volume 71, Issue 2

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

Volume 71, Issue 1

0 -- 0Xiao Hu 0005, Yufei Tao 0001. Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation
0 -- 0Aïna Linn Georges, Armaël Guéneau, Thomas Van Strydonck, Amin Timany, Alix Trieu, Dominique Devriese, Lars Birkedal. Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code
0 -- 0Dario Stein, Sam Staton. Probabilistic Programming with Exact Conditions
0 -- 0Sean Ovens. The Space Complexity of Consensus from Swap
0 -- 0Bhaskar Ray Chaudhury, Jugal Garg, Kurt Mehlhorn. EFX Exists for Three Agents
0 -- 0Paul Dütting, Zhe Feng 0004, Harikrishna Narasimhan, David C. Parkes, Sai Srivatsa Ravindranath. Optimal Auctions through Deep Learning: Advances in Differentiable Economics