OOIR: Observatory of International Research

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-04-01 to 2024-04-01.)

Article	Citations
A Proof of the CSP Dichotomy Conjecture	51
Solving Linear Programs in the Current Matrix Multiplication Time	47
Universally Composable Security	47
Planar Graphs Have Bounded Queue-Number	33
On Nonconvex Optimization for Machine Learning	29
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem	22
Distribution-free, Risk-controlling Prediction Sets	19
Twin-width I: Tractable FO Model Checking	17
Fully Online Matching	15
Algebraic Approach to Promise Constraint Satisfaction	15
A Simple and Approximately Optimal Mechanism for an Additive Buyer	15
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)	14
The Reachability Problem for Petri Nets Is Not Elementary	14
Competitive Caching with Machine Learned Advice	14
Automating Resolution is NP-Hard	13
Adjacency Labelling for Planar Graphs (and Beyond)	13
Representative Sets and Irrelevant Vertices	13
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device	12
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure	11
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time	11
Parallelism in Randomized Incremental Algorithms	10
Balancing Straight-line Programs	10
The Power of Shunning	10
A Universal Law of Robustness via Isoperimetry	10
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time	10

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce	8
The Log-Approximate-Rank Conjecture Is False	8
Near-optimal Distributed Triangle Enumeration via Expander Decompositions	8
Lower Bounds for Maximal Matchings and Maximal Independent Sets	8
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics	8
OptORAMa: Optimal Oblivious RAM	8
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound	8
Forcing and Calculi for Hybrid Logics	8
Logical Relations as Types: Proof-Relevant Parametricity for Program Modules	8
The Art Gallery Problem is ∃ℝ-complete	7
Atomic Embeddability, Clustered Planarity, and Thickenability	7
A Unified Translation of Linear Temporal Logic to ω-Automata	7
The Sample Complexity of Up-to-ε Multi-dimensional Revenue Maximization	7
Chasing Convex Bodies with Linear Competitive Ratio	6
The Marriage of Univalence and Parametricity	6
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization	6
A Correctness and Incorrectness Program Logic	6
Distributed Exact Shortest Paths in Sublinear Time	6
Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election	6
Frege Systems for Quantified Boolean Logic	6
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS	5
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs	5
The Reachability Problem for Two-Dimensional Vector Addition Systems with States	5
Planar Graph Perfect Matching Is in NC	5
Kernel-based Methods for Bandit Convex Optimization	5
Parameterized Intractability of Even Set and Shortest Vector Problem	5
Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime	5