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.

The Empirical Validation Gap 23
Tightening Theoretical Bounds by Optimizing Constant Factors 20
Transitioning from Monte Carlo to Deterministic Graph Algorithms 16
From Fractional Solutions to Discrete Decisions 12
The Computational Cost of High Precision 9
Generalizing Graph Algorithms to Directed and Weighted Networks 9
Proving Algorithmic Optimality via Complexity Conjectures 7
Quantum Query Complexity Lower Bounds 7
Proving Computational Intractability Through Hardness Reductions 7
Incremental Maintenance of Dynamic Graph Indices 7
Recursive Graph Partitioning 6
Tightening the Approximation Hardness Gap 5
Irrevocable Decisions in Online Resource Allocation 5
Navigating the Memory Bottleneck in Exact Algorithms 4
Closing the Optimality Gap in Online Algorithms 4

Top Authors

AuthorPapers
Haim Kaplan24
Richard Cole20
Christos Papadimitriou19
Andrew C Yao17
Kurt Mehlhorn17
Yishay Mansour16
C. Seshadhri15
Anupam Gupta14
MohammadTaghi Hajiaghayi14
Tim Roughgarden14
Toniann Pitassi14
Chandra Chekuri13
Parikshit Gopalan12
Aravind Srinivasan11
Joseph JaJa11
Monika Henzinger10
Ola Svensson9
Pinyan Lu9
Yossi Azar9
Daniel Rosenkrantz8

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
On k-Hulls and Related Problems1987
On Stochastic Scheduling with In-Tree Precedence Constraints1987
On the Computational Complexity of Algebra on Lattices1987
On the Optimal Control of Two Queues with Server Setup Times and its Analysis1987
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers1987
The Complexity of Reliable Concurrency Control1987
The Discrete Geodesic Problem1987
Tight Comparison Bounds on the Complexity of Parallel Sorting1987
An Amortized Analysis of Insertions into AVL-Trees1986
On the Validity of the Direct Sum Conjecture1986
Optimal Point Location in a Monotone Subdivision1986
Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze1986
Reducing Multiple Object Motion Planning to Graph Searching1986
Sums of Divisors, Perfect Numbers and Factoring1986
Equations Between Regular Terms and an Application to Process Logic1985
Finding Extremal Polygons1985
On Fault-Tolerant Networks for Sorting1985
On the Complexity of Maintaining Partial Sums1985
On the Expected Performance of Path Compression Algorithms1985
On the Movement of Robot Arms in 2-Dimensional Bounded Regions1985
Scheduling Flat Graphs1985
Searching Semisorted Tables1985
The Complexity of Distributed Concurrency Control1985
Unbounded Speed Variability in Distributed Communications Systems1985
Consistency and Serializability in Concurrent Database Systems1984
Information Transfer under Different Sets of Protocols1984
Is the Interesting Part of Process Logic Uninteresting? A Translation from PL to PDL1984
Movement Problems for 2-Dimensional Linkages1984
The Traveling Salesman Problem with Many Visits to Few Cities1984
Concurrency Control by Locking1983
On Proving Uniform Termination and Restricted Termination of Rewriting Systems1983
Optimal Placement for River Routing1983
A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions1982
Evaluation of Arithmetic Expressions with Algebraic Identities1982
Hamilton Paths in Grid Graphs1982
On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems1982
On Edge Coloring Bipartite Graphs1982
On Linear Characterizations of Combinatorial Optimization Problems1982
On the Average-Case Complexity of Selecting the kth Best1982
Parallel Algorithms in Graph Theory: Planarity Testing1982
The Complexity of Finding Cycles in Periodic Functions1982
An Analysis of a Memory Allocation Scheme for Implementing Stacks1981
Approximation Algorithms for Several Graph Augmentation Problems1981
Covering Graphs by Simple Circuits1981
Fast, Efficient Parallel Algorithms for Some Graph Problems1981
Worst-Case and Probabilistic Analysis of a Geometric Location Problem1981
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm1980
Bounds on Selection Networks1980
On the Complexity of Bilinear Forms with Commutativity1980
On the Polyhedral Decision Problem1980

« prev Page 19/20 next »