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 2021-12-01 to 2025-12-01.)

Article	Citations
Minimizing Convex Functions with Rational Minimizers	28
Vertex Connectivity in Poly-logarithmic Max-Flows	28
Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents	27
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time	26
Almost Optimal Exact Distance Oracles for Planar Graphs	24
Parallelize Single-Site Dynamics up to Dobrushin Criterion	23
Settling the Sample Complexity of Online Reinforcement Learning	22
A Framework for Adversarially Robust Streaming Algorithms	19
Proximity Gaps for Reed–Solomon Codes	18
Rate-independent Computation in Continuous Chemical Reaction Networks	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	15
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems	14
A New Minimax Theorem for Randomized Algorithms	13
Stochastic Games with Synchronization Objectives	13
The Limitations of Optimization from Samples	12
A Universal Law of Robustness via Isoperimetry	12
EFX Exists for Three Agents	12
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq	11
Relative Error Streaming Quantiles	10
Optimal Multi-Distribution Learning	10
How Much Data Is Sufficient to Learn High-Performing Algorithms?	10
Choiceless Polynomial Time with Witnessed Symmetric Choice	10

The Complexity of Computing KKT Solutions of Quadratic Programs	9
Computing a Fixed Point of Contraction Maps in Polynomial Queries	9
A Compositional Theory of Linearizability	9
Toward a Better Understanding of Randomized Greedy Matching	9
Topological Characterization of Consensus in Distributed Systems	8
On Strongest Algebraic Program Invariants	8
On the Need for Large Quantum Depth	8
Faster Modular Composition	8
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code	8
Efficient Normalization of Linear Temporal Logic	7
On the Zeros of Exponential Polynomials	7
An Efficient Quantum Factoring Algorithm	7
Invited Article Foreword	7
Smoothed Analysis of Information Spreading in Dynamic Networks	7
Negative-Weight Single-Source Shortest Paths in Near-linear Time	6
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds	6
The Art Gallery Problem is ∃ℝ-complete	6
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	6
Coverability in VASS Revisited: Improving Rackoff’s Bounds to Obtain Conditional Optimality	6
Memory Checking Requires Logarithmic Overhead	6