Journal of the ACM

Papers
(The TQCC of Journal of the ACM is 5. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-10-01 to 2024-10-01.)
ArticleCitations
Solving Linear Programs in the Current Matrix Multiplication Time65
On Nonconvex Optimization for Machine Learning38
Distribution-free, Risk-controlling Prediction Sets31
Competitive Caching with Machine Learned Advice29
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem27
Twin-width I: Tractable FO Model Checking27
Algebraic Approach to Promise Constraint Satisfaction26
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)19
The Reachability Problem for Petri Nets Is Not Elementary18
A Universal Law of Robustness via Isoperimetry18
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device17
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure16
Adjacency Labelling for Planar Graphs (and Beyond)15
Near-optimal Distributed Triangle Enumeration via Expander Decompositions15
Balancing Straight-line Programs13
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time12
Lower Bounds for Maximal Matchings and Maximal Independent Sets12
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce12
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time11
A Correctness and Incorrectness Program Logic11
The Art Gallery Problem is ∃ℝ-complete11
OptORAMa: Optimal Oblivious RAM10
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound10
The Sample Complexity of Up-to-ε Multi-dimensional Revenue Maximization9
Tight Bounds for Asymptotic and Approximate Consensus9
The Marriage of Univalence and Parametricity9
A Unified Translation of Linear Temporal Logic to ω-Automata9
Chasing Convex Bodies with Linear Competitive Ratio9
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics9
Kernel-based Methods for Bandit Convex Optimization8
Logical Relations as Types: Proof-Relevant Parametricity for Program Modules8
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS8
A Framework for Adversarially Robust Streaming Algorithms8
Optimal Auctions through Deep Learning: Advances in Differentiable Economics8
Atomic Embeddability, Clustered Planarity, and Thickenability7
Locally-iterative Distributed (Δ + 1)-coloring and Applications7
Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election7
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning7
Polynomiality for Bin Packing with a Constant Number of Item Types6
Parameterized Intractability of Even Set and Shortest Vector Problem6
The Reachability Problem for Two-Dimensional Vector Addition Systems with States6
Bernoulli Factories and Black-box Reductions in Mechanism Design6
On Strongest Algebraic Program Invariants6
Edge-Weighted Online Bipartite Matching5
Adversarial Bandits with Knapsacks5
Decentralized Asynchronous Crash-resilient Runtime Verification5
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once5
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs5
Complexity Analysis of Generalized and Fractional Hypertree Decompositions5
On the Need for Large Quantum Depth5
Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime5
0.032999992370605