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

Article	Citations
Solving Linear Programs in the Current Matrix Multiplication Time	65
On Nonconvex Optimization for Machine Learning	38
Distribution-free, Risk-controlling Prediction Sets	34
Competitive Caching with Machine Learned Advice	29
Twin-width I: Tractable FO Model Checking	27
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem	27
Algebraic Approach to Promise Constraint Satisfaction	26
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)	19
A Universal Law of Robustness via Isoperimetry	18
The Reachability Problem for Petri Nets Is Not Elementary	18
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device	17
String Diagram Rewrite Theory I: Rewriting with Frobenius Structure	16
Adjacency Labelling for Planar Graphs (and Beyond)	15
Near-optimal Distributed Triangle Enumeration via Expander Decompositions	15
Balancing Straight-line Programs	13
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce	12
Lower Bounds for Maximal Matchings and Maximal Independent Sets	12
The Art Gallery Problem is ∃ℝ-complete	11
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time	11
A Correctness and Incorrectness Program Logic	11
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound	10
OptORAMa: Optimal Oblivious RAM	10
The Marriage of Univalence and Parametricity	9
The Sample Complexity of Up-to-ε Multi-dimensional Revenue Maximization	9
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics	9

Chasing Convex Bodies with Linear Competitive Ratio	9
Tight Bounds for Asymptotic and Approximate Consensus	9
Optimal Auctions through Deep Learning: Advances in Differentiable Economics	8
Kernel-based Methods for Bandit Convex Optimization	8
Logical Relations as Types: Proof-Relevant Parametricity for Program Modules	8
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS	8
A Framework for Adversarially Robust Streaming Algorithms	8
Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election	7
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning	7
Atomic Embeddability, Clustered Planarity, and Thickenability	7
Locally-iterative Distributed (Δ + 1)-coloring and Applications	7
On Strongest Algebraic Program Invariants	6
Polynomiality for Bin Packing with a Constant Number of Item Types	6
Parameterized Intractability of Even Set and Shortest Vector Problem	6
The Reachability Problem for Two-Dimensional Vector Addition Systems with States	6
Bernoulli Factories and Black-box Reductions in Mechanism Design	6
Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once	5
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs	5
Complexity Analysis of Generalized and Fractional Hypertree Decompositions	5
Adversarial Bandits with Knapsacks	5
Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime	5
Edge-Weighted Online Bipartite Matching	5
On the Need for Large Quantum Depth	5
Decentralized Asynchronous Crash-resilient Runtime Verification	5