Default: SIAM Journal on Computing

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 122. It has an SJR impact factor of 2,471 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 2,471.

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

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -


- €

Inmediate OA


Embargoed OA

- €

Non OA


SIAM Journal on Computing


SJR Impact factor


H Index


Total Docs (Last Year)


Total Docs (3 years)


Total Refs


Total Cites (3 years)


Citable Docs (3 years)


Cites/Doc (2 years)




No comments ... Be the first to comment!

Aims and Scope

lower, relativizations, searchinggenerating, security, sets, structures, subdivisionthe, techniques, timedata, data, pyramid, point, notion, boundsa, optimal, approach, constant, location, multidimensional, landscape, bracelets, cellprobe, computersparse, cryptosystemsunifying, functional, amortized, monotone, movement,

Best articles by citations

Optimal Dynamic Sequence Representations

View more

Finding Points on Curves over Finite Fields

View more

A Parametrized Algorithm for Matroid Branch-Width

View more

The Accommodating Function: A Generalization of the Competitive Ratio

View more

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

View more

Polygon Retrieval

View more

An Optimal Algorithm for Checking Regularity

View more

A Fast Monte-Carlo Test for Primality

View more

Distances and Finger Search in Random Binary Search Trees

View more

An Optimal Competitive Strategy for Walking in Streets

View more

Learning a Hidden Matching

View more

On Testing Convexity and Submodularity

View more

Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications

View more

On the Asymptotic Complexity of Matrix Multiplication

View more

Approximate String Matching: A Simpler Faster Algorithm

View more

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

View more

Hardness of Approximation for Vertex-Connectivity Network Design Problems

View more

The Potential of the Approximation Method

View more

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

View more

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

View more

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

View more

Computational Complexity of Probabilistic Turing Machines

View more

A Polynomial-Time Algorithm for Near-Perfect Phylogeny

View more

Speed of Recognition of Context-Free Languages by Array Automata

View more