Write in a clean editor, then format for SIAM Journal on Computing in one click — DocuGuru applies the official SIAM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
SIAM Journal on Computing is a peer-reviewed journal published by SIAM, covering Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Optimization and Search Problems. Over its lifetime it has published 3,870 papers, which have received 304,170 citations.
| Publisher | SIAM |
|---|---|
| Reference style | Numbered (SIAM) Numbered — [1], [2] in the text [1] A. Smith, B. Jones, and C. Lee, A representative article title, SIAM Journal on Computing 12 (2023) 45–58.
Formats any DOI in the closest standard style — SIAM Journal on Computing has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Complexity and Algorithms in Graphs Advanced Graph Theory Research Optimization and Search Problems Algorithms and Data Compression Computational Geometry and Mesh Generation |
| ISSN | 0097-5397 |
| Citation impact (2-yr) | 1.01 |
| h-index | 238 |
| i10-index | 2,737 |
| Top institutions publishing here | Tel Aviv University |
| Journal website | www.siam.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Abstract. The value of depth-first search or "bacltracking " as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect graph are presented. The space and time requirements…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and…
We propose a fully functional identity-based encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem. Our system is based on the Weil pairing. We give precise definitions for secure identity based encryption schemes and give several applications for such systems.
Abstract. Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/non-Hamiltonian. In this paper a computational complexity…
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings. The constant of proportionality is low enough to make this algorithm of practical use, and the procedure can also be extended to deal with some more general pattern-matching…
SIAM Journal on Mathematical Analysis
SIAM Journal on Mathematics of Data Science
SIAM Journal on Matrix Analysis and Applications
SIAM Journal on Numerical Analysis
SIAM Journal on Optimization
SIAM Journal on Scientific Computing
Proceedings of the American Mathematical Society, Series B
Quarterly of Applied Mathematics
