SIAM Journal on Computing

Papers
(The TQCC of SIAM Journal on Computing is 1. 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-04-01 to 2025-04-01.)
ArticleCitations
Optimal (Euclidean) Metric Compression13
Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier11
Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017)10
Agreement Tests on Graphs and Hypergraphs9
Fast Generalized DFTs for All Finite Groups8
Parallel Repetition for the GHZ Game: Exponential Decay7
Caching with Time Windows and Delays7
Shortest Paths Without a Map, but with an Entropic Regularizer6
Metric Embedding via Shortest Path Decompositions6
Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions6
An Approximate Generalization of the Okamura–Seymour Theorem6
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions5
Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions5
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model4
Why Extension-Based Proofs Fail4
Fitting Metrics and Ultrametrics with Minimum Disagreements4
Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg–Rao4
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane4
Nondeterministic Quasi-Polynomial Time is Average-Case Hard for \(\textsf{ACC}\) Circuits4
The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side4
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion4
Clustering Mixtures with Almost Optimal Separation in Polynomial Time4
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering3
Unit Capacity Maxflow in Almost $m^{4/3}$ Time3
Tree-Depth and the Formula Complexity of Subgraph Isomorphism3
On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness3
Small but Unwieldy: A Lower Bound on Adjacency Labels for Small Classes3
Polynomial Data Structure Lower Bounds in the Group Model3
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity3
Tight Revenue Gaps among Multiunit Mechanisms3
QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge3
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths3
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization3
Induced Subgraphs of Bounded Treewidth and the Container Method3
Optimal Resizable Arrays2
Sorting Short Keys in Circuits of Size ${o(n \log n)}$2
Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough2
Special Section on the Fifty-First Annual ACM Sympositum on the Theory of Computing (STOC 2019)2
Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs2
Competitively Chasing Convex Bodies2
Approximation Algorithms for LCS and LIS with Truly Improved Running Times2
Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time2
Weak Zero-Knowledge beyond the Black-Box Barrier2
Correlation Decay and Partition Function Zeros: Algorithms and Phase Transitions2
Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments2
Optimal Algorithms for Geometric Centers and Depth2
Geodesic Walks in Polytopes2
Almost Optimal SuperConstant-Pass Streaming Lower Bounds for Reachability2
Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs2
Discrepancy Minimization via a Self-Balancing Walk2
Complexity Classification of Counting Graph Homomorphisms Modulo a Prime Number1
Bridging the Gap Between Tree and Connectivity Augmentation: Unified and Stronger Approaches1
A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs1
Agnostic Proper Learning of Monotone Functions: Beyond the Black-Box Correction Barrier1
Circuits Resilient to Short-Circuit Errors1
A Single-Exponential Time 2-Approximation Algorithm for Treewidth1
An Improved Parameterized Algorithm for Treewidth1
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems1
Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture1
An Optimal Separation of Randomized and Quantum Query Complexity1
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring1
On Matrix Multiplication and Polynomial Identity Testing1
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification1
Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing1
Economical Convex Coverings and Applications1
Traversing Combinatorial 0/1-Polytopes via Optimization1
Revisionist Simulations: A New Approach to Proving Space Lower Bounds1
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model1
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification1
Hop-Constrained Oblivious Routing1
Two Variable Logic with Ultimately Periodic Counting1
CLAP: A New Algorithm for Promise CSPs1
Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs1
Differentially Private Learning of Geometric Concepts1
Truly Optimal Euclidean Spanners1
Contextual Search via Intrinsic Volumes1
On the Privacy of Noisy Stochastic Gradient Descent for Convex Optimization1
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems1
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem1
Derandomization from Algebraic Hardness1
Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling1
Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring1
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing1
Minimum Cuts in Surface Graphs1
Online List Labeling: Breaking the \({\log^2 n}\) Barrier1
Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error1
Algorithms and Certificates for Boolean CSP Refutation: Smoothed Is No Harder than Random1
Isomorphism Testing for Graphs Excluding Small Minors1
Flow Time Scheduling and Prefix Beck–Fiala1
Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations1
Consensus-Halving: Does It Ever Get Easier?1
0.077713966369629