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

Article	Citations
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time	48
Almost Optimal Exact Distance Oracles for Planar Graphs	46
Minimizing Convex Functions with Rational Minimizers	35
Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents	32
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device	26
On the Power of Symmetric Linear Programs	24
A New Algorithm for Euclidean Shortest Paths in the Plane	22
A Framework for Adversarially Robust Streaming Algorithms	21
Rate-independent Computation in Continuous Chemical Reaction Networks	20
Proximity Gaps for Reed–Solomon Codes	19
Parallelize Single-Site Dynamics up to Dobrushin Criterion	19
The Reachability Problem for Two-Dimensional Vector Addition Systems with States	17
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization	15
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time	15
Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity	14
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems	13
The Limitations of Optimization from Samples	12
Stochastic Games with Synchronization Objectives	12
A New Minimax Theorem for Randomized Algorithms	12
EFX Exists for Three Agents	11
A Universal Law of Robustness via Isoperimetry	11
How Much Data Is Sufficient to Learn High-Performing Algorithms?	10
Correct and Complete Type Checking and Certified Erasure for Coq , in Coq	10
Choiceless Polynomial Time with Witnessed Symmetric Choice	10
Chasing Convex Bodies with Linear Competitive Ratio	9

Toward a Better Understanding of Randomized Greedy Matching	9
Relative Error Streaming Quantiles	9
A Compositional Theory of Linearizability	9
Twin-width I: Tractable FO Model Checking	9
Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime	8
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code	8
On the Need for Large Quantum Depth	7
Topological Characterization of Consensus in Distributed Systems	7
On Strongest Algebraic Program Invariants	7
Adjacency Labelling for Planar Graphs (and Beyond)	7
Faster Modular Composition	6
An Efficient Quantum Factoring Algorithm	6
Smoothed Analysis of Information Spreading in Dynamic Networks	6
Invited Article Foreword	5
On the Zeros of Exponential Polynomials	5
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds	5
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	5
The Art Gallery Problem is ∃ℝ-complete	5
Memory Checking Requires Logarithmic Overhead	5
Gradual System F	5
Efficient Normalization of Linear Temporal Logic	5
Transaction Fee Mechanism Design	5