SIAM Journal on Computing
966 papers367 directions
Papers by Year
| 2026 | 8 |
| 2025 | 27 |
| 2024 | 22 |
| 2023 | 21 |
| 2022 | 29 |
| 2021 | 33 |
| 2020 | 52 |
| 2019 | 35 |
| 2018 | 54 |
| 2017 | 42 |
| 2016 | 38 |
| 2015 | 34 |
| 2014 | 41 |
| 2013 | 45 |
| 2012 | 36 |
| 2011 | 48 |
| 2010 | 35 |
| 2009 | 38 |
| 2008 | 37 |
| 2007 | 22 |
| 2006 | 25 |
| 2005 | 20 |
| 2004 | 25 |
| 2003 | 20 |
| 2002 | 16 |
| 2001 | 13 |
| 2000 | 31 |
| 1999 | 19 |
| 1998 | 29 |
| 1997 | 17 |
| 1996 | 11 |
| 1995 | 16 |
| 1994 | 21 |
| 1993 | 17 |
| 1992 | 11 |
| 1991 | 9 |
| 1990 | 7 |
| 1989 | 10 |
| 1988 | 11 |
| 1987 | 11 |
| 1986 | 6 |
| 1985 | 10 |
| 1984 | 5 |
| 1983 | 3 |
| 1982 | 9 |
| 1981 | 5 |
| 1980 | 4 |
| 1979 | 4 |
| 1978 | 3 |
| 1977 | 3 |
| 1976 | 2 |
| 1973 | 4 |
Top Research Directions
Research directions most represented by papers from this venue.
Top Authors
Impactful Papers
Papers from this venue that shaped research clusters.
Foundational
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
foundational
Locally Decodable Codes from Mersenne Nu
2009
Erasure-Resilient Property Testing
foundational
Erasure-Resilient Property Testing
2018
Learning Kernel-Based Halfspaces with the 0-1 Loss
foundational
Linearizing Non-Convex Objectives via Ke
2011
Forrelation: A Problem That Optimally Separates Quantum from Classical Computing
foundational
Quantum Query Complexity for Combinatori
2018
Perfect Matchings in O(nlog n) Time in Regular Bipartite Graphs
foundational
Adaptive Random Walks for Graph Matching
2013
The Complexity of Planar Counting Problems
foundational
Preserving Planarity in Graph Reductions
1998
Lower-Stretch Spanning Trees
foundational
SPQR Trees for Constrained Graph Embeddi
2008
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity
foundational
The Domain Size Dependency of Differenti
2015
Nearly Tight Bounds for Testing Function Isomorphism
foundational
Isomorphism Testing Boundaries for Boole
2013
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
foundational
Dual-Set Tracking for Non-Monotone Submo
2015
Influential
The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Co
influential
The Alphabet Size Bottleneck in Optimal
2019
Constructive Discrepancy Minimization by Walking on the Edges
influential
Combinatorial Discrepancy Minimization
2015
The Submodular Secretary Problem Goes Linear
influential
Online Selection with Irrevocable Decisi
2018
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems.
influential
The Complexity of Prize Collecting Netwo
2018
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar_#CSP
influential
Computational Complexity Beyond Symmetri
2017
Testing probability distributions using conditional samples
influential
The Computational Cost of High Precision
2015
An Approximate L1-Difference Algorithm for Massive Data Streams
influential
The Computational Cost of High Precision
2002
Regular Graphs and the Spectra of Two-Variable Logic with Counting
influential
The Two-Variable Boundary in Lifted Prob
2015
Linear Probing with Constant Independence
influential
The Empirical Validation Gap
2009
Known Algorithms for Edge Clique Cover are Probably Optimal
influential
Proving Algorithmic Optimality via Compl
2016
Related Venues
Venues with the most similar research cluster distributions.
SODA81% similar · 2,036 papers
STOC78% similar · 1,631 papers
Esa74% similar · 632 papers
ICALP73% similar · 1,234 papers
FOCS72% similar · 1,306 papers
ACM Trans. Algorithms72% similar · 355 papers
Approx-random69% similar · 404 papers
J. ACM65% similar · 532 papers
Isaac60% similar · 401 papers
Ipco60% similar · 244 papers