Theoretical Computer Science

Theoretical Computer Science - ISSN 0304-3975
Source Normalized Impact per Paper (SNIP): 1.345 Source Normalized Impact per Paper (SNIP):
SNIP measures contextual citation impact by weighting citations based on the total number of citations in a subject field.
SCImago Journal Rank (SJR): 0.72 SCImago Journal Rank (SJR):
SJR is a prestige metric based on the idea that not all citations are the same. SJR uses a similar algorithm as the Google page rank; it provides a quantitative and a qualitative measure of the journal’s impact.
Impact Factor: 0.643 (2015) Impact Factor:
The Impact Factor measures the average number of citations received in a particular year by papers published in the journal during the two preceding years.
© Thomson Reuters Journal Citation Reports 2015
5 Year Impact Factor: 0.827 (2015) Five-Year Impact Factor:
To calculate the five year Impact Factor, citations are counted in 2014 to the previous five years and divided by the source items published in the previous five years.
© Journal Citation Reports 2015, Published by Thomson Reuters
Volumes: Volumes 657-704
Issues: 48 issues
ISSN: 03043975

Institutional Subscription

Tax/VAT will be calculated at check-out
eJournal
This journal does not feature personal pricing and is not available for personal subscription.

Shop With Confidence

  • Free Shipping around the world
  • Broad range of products

Description

Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.

Any queries about submissions and peer review should be addressed to the TCS editorial office: tcs@elsevier.com.

Papers published in Theoretical Computer Science are grouped in three sections according to their nature. The first section `Algorithms, automata, complexity and games' is devoted to the study of algorithms and their complexity using analytical, combinatorial or probabilistic methods. It includes the whole field of abstract complexity (i.e. all the results about the hierarchies that can be defined using Turing machines), the whole field of automata and language theory (including automata on infinite words and infinitary languages), the whole field of geometrical (graphic) applications and the whole field of measurement of system performance using statistical methods.

The second section,`Logic, semantics and theory of programming', is devoted to formal methods to check properties of programs or implement formally described languages; it contains all papers dealing with semantics of sequential and parallel programming languages. All formal methods treating these problems are published in this section, including rewriting techniques, abstract data types, automatic theorem proving, calculi such as SCP or CCS, Petri nets, new logic calculi and developments in categorical methods.

The third section, 'Natural Computing', is devoted to the study of computing occurring in nature and computing inspired by nature. In the rapidly evolving field of computer science, natural computing plays an important role as the catalyst for the synergy of human designed computing with the computing going on in nature. This synergy leads to a deeper and broader understanding of the nature of computation. Although natural computing is concerned also with experiments and applications, this section of Theoretical Computer Science is focused on the theoretical aspects of natural computing with clear relevance to computing. Among others, it will contain papers dealing with the theoretical issues in evolutionary computing, neural networks, molecular computing, and quantum computing.