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 2022-05-01 to 2026-05-01.)

Article	Citations
Vertex Connectivity in Poly-logarithmic Max-Flows	44
Minimizing Convex Functions with Rational Minimizers	39
Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents	32
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time	30
Almost Optimal Exact Distance Oracles for Planar Graphs	27
Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm	26
Ribbon: Fast Succinct Static Retrieval and Approximate Membership	24
A New Algorithm for Euclidean Shortest Paths in the Plane	23
Settling the Sample Complexity of Online Reinforcement Learning	20
Proximity Gaps for Reed–Solomon Codes	19
Rate-independent Computation in Continuous Chemical Reaction Networks	19
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems	18
Parallelize Single-Site Dynamics up to Dobrushin Criterion	18
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time	16
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization	15
Generative Social Choice	14
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits	14
Stochastic Games with Synchronization Objectives	13
The Limitations of Optimization from Samples	13
A New Minimax Theorem for Randomized Algorithms	12
EFX Exists for Three Agents	11
How Much Data Is Sufficient to Learn High-Performing Algorithms?	10
A Universal Law of Robustness via Isoperimetry	10
Towards P≠NP from Extended Frege lower bounds	10
Indistinguishability Obfuscation from Well-Founded Assumptions	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
Relative Error Streaming Quantiles	9
The Complexity of Computing KKT Solutions of Quadratic Programs	8
Optimal Multi-Distribution Learning	8
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code	8
A Compositional Theory of Linearizability	8
Equivalence and Conditional Independence in Atomic Sheaf Logic	8
Toward a Better Understanding of Randomized Greedy Matching	8
Vizing’s Theorem in Near-Linear Time	7
Topological Characterization of Consensus in Distributed Systems	7
On the Need for Large Quantum Depth	6
Smoothed Analysis of Information Spreading in Dynamic Networks	6
Faster Modular Composition	6
An Efficient Quantum Factoring Algorithm	6
On Strongest Algebraic Program Invariants	6
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds	5
Efficient Normalization of Linear Temporal Logic	5
Memory Checking Requires Logarithmic Overhead	5
On the Zeros of Exponential Polynomials	5