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

Article	Citations
Minimizing Convex Functions with Rational Minimizers	56
Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents	39
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time	27
Almost Optimal Exact Distance Oracles for Planar Graphs	24
Vertex Connectivity in Poly-logarithmic Max-Flows	24
Proximity Gaps for Reed–Solomon Codes	22
A New Algorithm for Euclidean Shortest Paths in the Plane	21
A Framework for Adversarially Robust Streaming Algorithms	21
Parallelize Single-Site Dynamics up to Dobrushin Criterion	20
Rate-independent Computation in Continuous Chemical Reaction Networks	18
Settling the Sample Complexity of Online Reinforcement Learning	18
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization	16
Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity	15
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits	15
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time	15
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems	15
The Limitations of Optimization from Samples	14
Stochastic Games with Synchronization Objectives	14
A Universal Law of Robustness via Isoperimetry	14
A New Minimax Theorem for Randomized Algorithms	14
EFX Exists for Three Agents	13
How Much Data Is Sufficient to Learn High-Performing Algorithms?	12
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq	12
Relative Error Streaming Quantiles	11
Computing a Fixed Point of Contraction Maps in Polynomial Queries	10

Twin-width I: Tractable FO Model Checking	10
Choiceless Polynomial Time with Witnessed Symmetric Choice	10
Optimal Multi-Distribution Learning	10
Adjacency Labelling for Planar Graphs (and Beyond)	10
A Compositional Theory of Linearizability	9
Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime	9
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code	9
Toward a Better Understanding of Randomized Greedy Matching	9
The Complexity of Computing KKT Solutions of Quadratic Programs	8
Smoothed Analysis of Information Spreading in Dynamic Networks	7
On the Need for Large Quantum Depth	7
On the Zeros of Exponential Polynomials	7
Faster Modular Composition	7
On Strongest Algebraic Program Invariants	7
An Efficient Quantum Factoring Algorithm	7
Topological Characterization of Consensus in Distributed Systems	7
The Art Gallery Problem is ∃ℝ-complete	6
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	6
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds	6
Efficient Normalization of Linear Temporal Logic	6
Gradual System F	6
Negative-Weight Single-Source Shortest Paths in Near-linear Time	6
Memory Checking Requires Logarithmic Overhead	6
Invited Article Foreword	6