ISSN: 1551-305X

Journal Home

Journal Guideline

Foundations and Trends in Theoretical Computer Science Q2 Unclaimed

Now Publishers Inc United States

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

Foundations and Trends in Theoretical Computer Science is a journal indexed in SJR in Theoretical Computer Science with an H index of 31. It has an SJR impact factor of 0,647 and it has a best quartile of Q2. It has an SJR impact factor of 0,647.

Type: Journal

Type of Copyright:

Languages:

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Theoretical Computer Science (Q2)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

Foundations and Trends in Theoretical Computer Science

0,647

SJR Impact factor

31

H Index

2

Total Docs (Last Year)

3

Total Docs (3 years)

463

Total Refs

4

Total Cites (3 years)

3

Citable Docs (3 years)

1.33

Cites/Doc (2 years)

231.5

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

Computer Speech and Language Q2
ACM Transactions on Computation Theory Q2
Theory of Computing Q2
4OR Q2
Expert Systems Q2

Compare this journals

Aims and Scope

Best articles by citations

Locally Decodable Codes

Mathematical Aspects of Mixing Times in Markov Chains

Spectral Algorithms

Lower Bounds in Communication Complexity

On Doubly-Efficient Interactive Proof Systems

Quantum Hamiltonian Complexity

lgorithmic and Analysis Techniques in Property Testing

Data Streams: Algorithms and Applications

Communication Complexity (for Algorithm Designers)

Faster Algorithms via Approximation Theory

The Algorithmic Foundations of Differential Privacy

Hashing, Load Balancing and Multiple Choice

SHOW MORE ARTICLES

Probabilistic Proof Systems: A Primer

A Decade of Lattice Cryptography

Algorithmic Results in List Decoding

Partial Derivatives in Arithmetic Complexity and Beyond

Algorithms and Data Structures for External Memory

Complexity Lower Bounds using Linear Algebra

Average-Case Complexity

Lx = b

Complexity of Linear Boolean Operators

Pseudorandomness

Quantum Proofs

Evasiveness of Graph Properties and Topological Fixed-Point Theorems