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

Article	Citations
Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm	54
Ribbon: Fast Succinct Static Retrieval and Approximate Membership	42
Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents	36
Minimizing Convex Functions with Rational Minimizers	33
Almost Optimal Exact Distance Oracles for Planar Graphs	32
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time	30
Vertex Connectivity in Poly-logarithmic Max-Flows	29
On the Node-Averaged Complexity of Locally Checkable Problems on Trees	27
Untangling Graphs on Surfaces	24
A New Algorithm for Euclidean Shortest Paths in the Plane	23
Settling the Sample Complexity of Online Reinforcement Learning	23
Parallelize Single-Site Dynamics up to Dobrushin Criterion	22
Proximity Gaps for Reed–Solomon Codes	21
Rate-independent Computation in Continuous Chemical Reaction Networks	20
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams	20
Optimal Computation in Anonymous Dynamic Networks	16
Generative Social Choice	15
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time	15
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits	15
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems	15
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization	14
Stochastic Games with Synchronization Objectives	14
A New Minimax Theorem for Randomized Algorithms	13
Towards P≠NP from Extended Frege lower bounds	12
EFX Exists for Three Agents	11

Indistinguishability Obfuscation from Well-Founded Assumptions	11
A Universal Law of Robustness via Isoperimetry	11
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq	10
Choiceless Polynomial Time with Witnessed Symmetric Choice	10
How Much Data Is Sufficient to Learn High-Performing Algorithms?	10
A Compositional Theory of Linearizability	9
Optimal Multi-Distribution Learning	9
Relative Error Streaming Quantiles	9
Computing a Fixed Point of Contraction Maps in Polynomial Queries	9
The Complexity of Computing KKT Solutions of Quadratic Programs	9
Toward a Better Understanding of Randomized Greedy Matching	8
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code	8
Vizing’s Theorem in Near-Linear Time	7
Equivalence and Conditional Independence in Atomic Sheaf Logic	7
Topological Characterization of Consensus in Distributed Systems	7
An Efficient Quantum Factoring Algorithm	6
On the Need for Large Quantum Depth	6
Distributed \Delta -Coloring Plays Hide-and-Seek	6
Faster Modular Composition	6
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds	6
Smoothed Analysis of Information Spreading in Dynamic Networks	6
On Strongest Algebraic Program Invariants	6
On the Zeros of Exponential Polynomials	6