OOIR: Observatory of International Research

Papers

(The TQCC of Journal of the ACM is 6. 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 2022-01-01 to 2026-01-01.)

Article	Citations
Vertex Connectivity in Poly-logarithmic Max-Flows	31
Minimizing Convex Functions with Rational Minimizers	30
Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents	28
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time	28
Almost Optimal Exact Distance Oracles for Planar Graphs	26
Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm	22
Parallelize Single-Site Dynamics up to Dobrushin Criterion	22
Settling the Sample Complexity of Online Reinforcement Learning	20
Rate-independent Computation in Continuous Chemical Reaction Networks	19
A Framework for Adversarially Robust Streaming Algorithms	18
Proximity Gaps for Reed–Solomon Codes	18
A New Algorithm for Euclidean Shortest Paths in the Plane	17
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time	16
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits	16
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization	14
A New Minimax Theorem for Randomized Algorithms	13
Stochastic Games with Synchronization Objectives	13
The Limitations of Optimization from Samples	13
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems	13
EFX Exists for Three Agents	12
A Universal Law of Robustness via Isoperimetry	11
Indistinguishability Obfuscation from Well-Founded Assumptions	10
How Much Data Is Sufficient to Learn High-Performing Algorithms?	10
Optimal Multi-Distribution Learning	9
Choiceless Polynomial Time with Witnessed Symmetric Choice	9

Computing a Fixed Point of Contraction Maps in Polynomial Queries	9
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq	9
Toward a Better Understanding of Randomized Greedy Matching	8
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code	8
A Compositional Theory of Linearizability	8
Topological Characterization of Consensus in Distributed Systems	8
Relative Error Streaming Quantiles	8
The Complexity of Computing KKT Solutions of Quadratic Programs	8
Smoothed Analysis of Information Spreading in Dynamic Networks	7
An Efficient Quantum Factoring Algorithm	7
On Strongest Algebraic Program Invariants	7
Faster Modular Composition	7
On the Need for Large Quantum Depth	7
Efficient Normalization of Linear Temporal Logic	6
On the Zeros of Exponential Polynomials	6
Invited Article Foreword	6
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	6
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds	6
Memory Checking Requires Logarithmic Overhead	6