OOIR: Observatory of International Research

Papers

(The median citation count of Journal of the ACM is 2. 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-11-01 to 2025-11-01.)

Article	Citations
Vertex Connectivity in Poly-logarithmic Max-Flows	49
Minimizing Convex Functions with Rational Minimizers	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	25
Settling the Sample Complexity of Online Reinforcement Learning	22
Parallelize Single-Site Dynamics up to Dobrushin Criterion	22
Proximity Gaps for Reed–Solomon Codes	21
A New Algorithm for Euclidean Shortest Paths in the Plane	19
A Framework for Adversarially Robust Streaming Algorithms	18
Rate-independent Computation in Continuous Chemical Reaction Networks	17
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits	17
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time	16
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization	16
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems	15
Stochastic Games with Synchronization Objectives	14
A New Minimax Theorem for Randomized Algorithms	13
EFX Exists for Three Agents	12
The Limitations of Optimization from Samples	12
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
Relative Error Streaming Quantiles	10
How Much Data Is Sufficient to Learn High-Performing Algorithms?	10
Twin-width I: Tractable FO Model Checking	9

Optimal Multi-Distribution Learning	9
Toward a Better Understanding of Randomized Greedy Matching	9
Computing a Fixed Point of Contraction Maps in Polynomial Queries	9
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code	8
Topological Characterization of Consensus in Distributed Systems	8
The Complexity of Computing KKT Solutions of Quadratic Programs	8
Faster Modular Composition	8
A Compositional Theory of Linearizability	8
On the Need for Large Quantum Depth	8
An Efficient Quantum Factoring Algorithm	7
On the Zeros of Exponential Polynomials	7
On Strongest Algebraic Program Invariants	7
Smoothed Analysis of Information Spreading in Dynamic Networks	7
Invited Article Foreword	6
Efficient Normalization of Linear Temporal Logic	6
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP	6
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds	6
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	6
Memory Checking Requires Logarithmic Overhead	6
Negative-Weight Single-Source Shortest Paths in Near-linear Time	6
The Art Gallery Problem is ∃ℝ-complete	5
Gradual System F	5
Coverability in VASS Revisited: Improving Rackoff’s Bounds to Obtain Conditional Optimality	5
Axiomatization of Compact Initial Value Problems: Open Properties	4
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS	4
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes	4
Transaction Fee Mechanism Design	4
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring	4
QCSP Monsters and the Demise of the Chen Conjecture	3
Separations in Proof Complexity and TFNP	3
Adaptive and Fair Transformation for Recoverable Mutual Exclusion	3
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning	3
Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium	3
General Strong Polarization	3
2-Approximation for Prize-Collecting Steiner Forest	3
Pliability and Approximating Max-CSPs	3
Whole-grain Petri Nets and Processes	3
Deterministic Minimum Cut in Poly-logarithmic Maximum Flows	3
Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense k -SUM and k -XOR	3
Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors	3
Hardness of Approximate Diameter: Now for Undirected Graphs	2
Parameterized Inapproximability Hypothesis under ETH	2
A Correctness and Incorrectness Program Logic	2
Convex Hulls of Random Order Types	2
Dominantly Truthful Peer Prediction Mechanisms with a Finite Number of Tasks	2
The Space Complexity of Consensus from Swap	2
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing	2
Consistency of Relations over Monoids	2
Subsampling Suffices for Adaptive Data Analysis	2
Killing a Vortex	2

Orbit-finite Linear Programming	2
Oracle Separation of BQP and PH	2
Generative Datalog with Continuous Distributions	2
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness	2
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead	2
Exponentially Faster Shortest Paths in the Congested Clique	2
Anonymous Shared Memory	2
Locally-iterative Distributed (Δ + 1)-coloring and Applications	2
Spatial Isolation Implies Zero Knowledge Even in a Quantum World	2
Chains, Koch Chains, and Point Sets with Many Triangulations	2
Smoothed Analysis with Adaptive Adversaries	2
SPARKs: Succinct Parallelizable Arguments of Knowledge	2
The Price of Anarchy of Strategic Queuing Systems	2
Breaking the Metric Voting Distortion Barrier	2