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

Article	Citations
Vertex Connectivity in Poly-logarithmic Max-Flows	31
Minimizing Convex Functions with Rational Minimizers	30
Lower Bounds on Implementing Mediators in Asynchronous Systems with Rational and Malicious Agents	28
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time	28
Almost Optimal Exact Distance Oracles for Planar Graphs	26
Parallelize Single-Site Dynamics up to Dobrushin Criterion	22
Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm	22
Settling the Sample Complexity of Online Reinforcement Learning	20
Rate-independent Computation in Continuous Chemical Reaction Networks	19
A Framework for Adversarially Robust Streaming Algorithms	18
Proximity Gaps for Reed–Solomon Codes	18
A New Algorithm for Euclidean Shortest Paths in the Plane	17
Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time	16
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits	16
Learning to Branch: Generalization Guarantees and Limits of Data-Independent Discretization	14
Stochastic Games with Synchronization Objectives	13
The Limitations of Optimization from Samples	13
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems	13
A New Minimax Theorem for Randomized Algorithms	13
EFX Exists for Three Agents	12
A Universal Law of Robustness via Isoperimetry	11
Indistinguishability Obfuscation from Well-Founded Assumptions	10
How Much Data Is Sufficient to Learn High-Performing Algorithms?	10
Optimal Multi-Distribution Learning	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
Toward a Better Understanding of Randomized Greedy Matching	8
Cerise: Program Verification on a Capability Machine in the Presence of Untrusted Code	8
A Compositional Theory of Linearizability	8
Topological Characterization of Consensus in Distributed Systems	8
Relative Error Streaming Quantiles	8
The Complexity of Computing KKT Solutions of Quadratic Programs	8
An Efficient Quantum Factoring Algorithm	7
On Strongest Algebraic Program Invariants	7
Faster Modular Composition	7
On the Need for Large Quantum Depth	7
Smoothed Analysis of Information Spreading in Dynamic Networks	7
Invited Article Foreword	6
Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection	6
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds	6
Memory Checking Requires Logarithmic Overhead	6
Efficient Normalization of Linear Temporal Logic	6
On the Zeros of Exponential Polynomials	6
Coverability in VASS Revisited: Improving Rackoff’s Bounds to Obtain Conditional Optimality	5
Negative-Weight Single-Source Shortest Paths in Near-linear Time	5
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP	5
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring	4
Transaction Fee Mechanism Design	4
Axiomatization of Compact Initial Value Problems: Open Properties	4
Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated Equilibrium	4
Gradual System F	4
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes	4
Adaptive and Fair Transformation for Recoverable Mutual Exclusion	3
Separations in Proof Complexity and TFNP	3
Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense k -SUM and k -XOR	3
Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning	3
Anonymous Shared Memory	3
Whole-grain Petri Nets and Processes	3
General Strong Polarization	3
2-Approximation for Prize-Collecting Steiner Forest	3
Pliability and Approximating Max-CSPs	3
Killing a Vortex	3
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS	3
Deterministic Minimum Cut in Poly-logarithmic Maximum Flows	3
QCSP Monsters and the Demise of the Chen Conjecture	3
Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors	3
Oracle Separation of BQP and PH	2
Parameterized Inapproximability Hypothesis under ETH	2
Consistency of Relations over Monoids	2
Orbit-finite Linear Programming	2
Convex Hulls of Random Order Types	2
Smoothed Analysis with Adaptive Adversaries	2
Symmetric Exponential Time Requires Near-Maximum Circuit Size	2
The Price of Anarchy of Strategic Queuing Systems	2

Breaking the Metric Voting Distortion Barrier	2
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing	2
Hardness of Approximate Diameter: Now for Undirected Graphs	2
SPARKs: Succinct Parallelizable Arguments of Knowledge	2
Chains, Koch Chains, and Point Sets with Many Triangulations	2
Generative Datalog with Continuous Distributions	2
A Correctness and Incorrectness Program Logic	2
Subsampling Suffices for Adaptive Data Analysis	2
Spatial Isolation Implies Zero Knowledge Even in a Quantum World	2
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead	2
Exponentially Faster Shortest Paths in the Congested Clique	2
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness	2
Better-Than-2 Approximations for Weighted Tree Augmentation and Applications to Steiner Tree	2
The Space Complexity of Consensus from Swap	2
Dominantly Truthful Peer Prediction Mechanisms with a Finite Number of Tasks	2