Theory of Computing Systems Q2 Unclaimed
Theory of Computing Systems is a journal indexed in SJR in Computational Theory and Mathematics and Theoretical Computer Science with an H index of 48. It has a price of 2190 €. It has an SJR impact factor of 0,661 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,661.
Type: Journal
Type of Copyright:
Languages: English
Open Access Policy: Open Choice
Type of publications:
Publication frecuency: -
2190 €
Inmediate OANPD
Embargoed OA0 €
Non OAMetrics
0,661
SJR Impact factor48
H Index58
Total Docs (Last Year)159
Total Docs (3 years)1653
Total Refs157
Total Cites (3 years)149
Citable Docs (3 years)1.11
Cites/Doc (2 years)28.5
Ref/DocOther journals with similar parameters
Journal of Automated Reasoning Q2
International Journal of Fuzzy Systems Q2
Digital Signal Processing: A Review Journal Q2
Queueing Systems Q2
Expert Systems Q2
Compare this journals
Aims and Scope
Best articles by citations
Foreword
View moreFirst-Order Orbit Queries
View moreLower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
View moreOn the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem
View moreForeword
View moreNonblocking k-Compare-Single-Swap
View moreGeneric Results for Concatenation Hierarchies
View moreFinding Similar Users in Social Networks
View moreExistential and Positive Theories of Equations in Graph Products
View moreSpecial Issue on Fun with Algorithms
View moreForeword
View moreGeneralized Model-Checking over Locally Tree-Decomposable Classes
View moreAsymmetric Communication Protocols via Hotlink Assignments
View moreEffective Categoricity of Automatic Equivalence and Nested Equivalence Structures
View moreComputing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains
View moreAutomatable Verification of Sequential Consistency
View moreHierarchical Ring Network design
View moreTwo Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
View moreDoes the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
View moreComparing Verboseness for Finite Automata and Turing Machines
View moreMorpion Solitaire
View moreDynamic Generation of Discrete Random Variates
View moreA Note on Square Rooting of Time Functions of Turing Machines
View moreThe (Non)Enumerability of the Determinant and the Rank
View more
Comments