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
Dynamic Binary Search1979
Optimal Evaluation of Pairs of Bilinear Forms1979
Scheduling Interval-Ordered Tasks1979
The Complexity of Pattern Matching for a Random String1979
Computational Parallels Between the Regular and Context-Free Languages1978
On the Loop Switching Addressing Problem1978
Polynomial Algorithms for Deterministic Pushdown Automata1978
A Best Possible Bound for the Weighted Path Length of Binary Search Trees1977
An Analysis of Several Heuristics for the Traveling Salesman Problem1977
On the Complexity of Local Search for the Traveling Salesman Problem1977
On Finding Lowest Common Ancestors in Trees1976
On the Evaluation of Powers1976
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs1973
Dividing a Graph into Triconnected Components1973
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms1973
Set Merging Algorithms1973

« prev Page 20/20