ISSN: 0097-5397

Journal Home

Journal Guideline

SIAM Journal on Computing Q1 Unclaimed

Society for Industrial and Applied Mathematics Publications United States

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

SIAM Journal on Computing is a journal indexed in SJR in Mathematics (miscellaneous) and Computer Science (miscellaneous) with an H index of 127. It has an SJR impact factor of 2,143 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 2,143.

SIAM Journal on Computing focuses its scope in these topics and keywords: monotone, data, timedata, techniques, subdivisionthe, structures, sets, security, searchinggenerating, lower, ...

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Computer Science (miscellaneous) (Q1) Mathematics (miscellaneous) (Q1)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

2,143

SJR Impact factor

127

H Index

61

Total Docs (Last Year)

190

Total Docs (3 years)

2690

Total Refs

453

Total Cites (3 years)

186

Citable Docs (3 years)

1.86

Cites/Doc (2 years)

44.1

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Acta Numerica Q1
Annals of Mathematics Q1
Publications Mathematiques Q1
Journal of the American Mathematical Society Q1
Acta Mathematica Q1

Compare this journals

Aims and Scope

Best articles by citations

Optimal Dynamic Sequence Representations

Finding Points on Curves over Finite Fields

A Parametrized Algorithm for Matroid Branch-Width

The Accommodating Function: A Generalization of the Competitive Ratio

Regular Graphs and the Spectra of Two-Variable Logic with Counting

Polygon Retrieval

An Optimal Algorithm for Checking Regularity

A Fast Monte-Carlo Test for Primality

Distances and Finger Search in Random Binary Search Trees

An Optimal Competitive Strategy for Walking in Streets

Learning a Hidden Matching

On Testing Convexity and Submodularity

SHOW MORE ARTICLES

Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications

On the Asymptotic Complexity of Matrix Multiplication

Approximate String Matching: A Simpler Faster Algorithm

RSA and Rabin Functions: Certain Parts are as Hard as the Whole

Hardness of Approximation for Vertex-Connectivity Network Design Problems

The Potential of the Approximation Method

When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

Computational Complexity of Probabilistic Turing Machines

A Polynomial-Time Algorithm for Near-Perfect Phylogeny

Speed of Recognition of Context-Free Languages by Array Automata