SIAM Journal on Computing

Aims & Scope

The SIAM Journal on Computing aims to provide coverage of the most significant work going on in the mathematical and formal aspects of computer science and nonnumerical computing.

Submissions must be clearly written and make a significant technical contribution.

Topics include but are not limited to analysis and design of algorithms, algorithmic game theory, data structures, computational complexity, computational algebra, computational aspects of combinatorics and graph theory, computational biology, computational geometry, computational robotics, the mathematical aspects of programming languages, artificial intelligence, computational learning, databases, information retrieval, cryptography, networks, distributed computing, parallel algorithms, and computer architecture.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	1.6
2024	1.20

SJR (SCImago Journal Rank)

Year	Value
2024	1.400

Quartile

Year	Value
2024	Q1

h-index

Year	Value
2024	131

Journal Rank

Year	Value
2024	2701

Journal Citation Indicator

Year	Value
2024	428

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  Citation: 5163

  Authors: Peter W.

• Depth-First Search and Linear Graph Algorithms

  Citation: 4352

  Authors: Robert

• The Knowledge Complexity of Interactive Proof Systems

  Citation: 1997

  Authors: Shafi, Silvio, Charles

• Sparse Approximate Solutions to Linear Systems

  Citation: 1927

  Authors: B. K.

• Fast Pattern Matching in Strings

  Citation: 1919

  Authors: Donald E., James H., Vaughan R.

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

  Citation: 1869

  Authors: John E., Richard M.

• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

  Citation: 1820

  Authors: Shafi, Silvio, Ronald L.

• Identity-Based Encryption from the Weil Pairing

  Citation: 1607

  Authors: Dan, Matthew

• The Complexity of Enumeration and Reliability Problems

  Citation: 1301

  Authors: Leslie G.

• Suffix Arrays: A New Method for On-Line String Searches

  Citation: 1232

  Authors: Udi, Gene

---