Journal Information

Theoretical Computer Science (TCS)

Please Login to view website of journal
Free account: view official websites, track deadlines, and get email reminders.
Register Login
Get this via API
Search and ranking lists need no credentials at all; full detail for this page needs a free API key. See the developer guide.
Impact Factor:
1.1
Publisher:
Elsevier
ISSN:
0304-3975
Viewed:
40326
Tracked:
26

Call For Papers

Theoretical Computer Science (TCS) is an academic journal published by Elsevier. (ISSN 0304-3975, impact factor 1.1, CCF B).

Aims & Scope 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: [email protected]. 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. Theoretical Computer Science will now publish high-quality advanced introductions. Advanced introductions, which are by invitation only, should cover a focused topic within the scope of TCS at a level that would be appropriate for a scientist who is new to the topic and wishes to gain an up-to-date understanding. Articles should be self-contained, including motivation and basic definitions, and proceed to advanced material and/or open problems which may - but need not - include new results. Sufficient references should be given to provide the reader with entry points to the research literature on the topic as well as the origins of the main ideas. Submissions will go through the standard review process of TCS.
Last updated by Admin Agent on

Special Issues

Special Issue on Fun with Algorithms 2026 Submission Date: 2026-10-31 FUN is a series of conferences dedicated to the use, design, and analysis of algorithms and data structures, focusing on results that are "fun" but also original and scientifically solid. "Fun" can be defined in many ways: we think of fun results as being amusing or entertaining by their display of elegance, simplicity, surprise, originality, or wit. The topics of interest include all aspects of algorithm design and analysis under any computing model. Guest editor: John Iacono, Professeur Université libre de Bruxelles, Brussels, Belgium https://www.sciencedirect.com/special-issue/336391/special-issue-on-fun-with-algorithms-2026
Last updated by Admin Agent on
Special Issue on the 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026) Submission Date: 2026-10-31 This special issue of Theoretical Computer Science is based on papers that originally appeared as extended abstracts in the Proceedings of the 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Papers were selected by the program committee of SAND 2026 based on their quality and importance as well as for their representation of the different areas covered by the conference. Guest editors: Dr. George Mertzios, Durham University, UK Dr. Andrea Richa, Arizona State University, US Special issue information: This special issue of Theoretical Computer Science is based on papers that originally appeared as extended abstracts in the Proceedings of the 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026). Papers were selected by the program committee of SAND 2026 based on their quality and importance as well as for their representation of the different areas covered by the conference. The Symposium on Algorithmic Foundations of Dynamic Networks is a primary venue for original research on the fundamental aspects of computing in dynamic networks and dynamic computational processes. Broadly, the conference and its community aim to improve understanding of the role of dynamics in computing. SAND seeks high-quality contributions related to this aim from all viewpoints, including theory, design, analysis, and applications, and welcomes both conceptual and technical contributions, as wellas novel ideas and new problems. Manuscript submission information: Authors should submit their manuscripts to the Theoretical Computer Science Editorial System (EM) at Submission site for Theoretical Computer Science, and select " VSI: SAND 2026” when they reach the “Article Type” step in the submission process. General information for submitting papers to TCS can be found at Guide for Authors - Theoretical Computer Science. Final Manuscript Submission Deadline: 31st October 2026 Keywords: dynamic network analysis; temporal graphs; dynamic computational processes; distributed computation in dynamic networks https://www.sciencedirect.com/special-issue/335428/special-issue-on-the-5th-symposium-on-algorithmic-foundations-of-dynamic-networks-sand-2026
Last updated by Admin Agent on
Special Issue on Honour of Maxime Crochemore 80th’s Birthday Submission Date: 2026-12-15 Combinatorial pattern matching is a highly active and timely research area, driven by both foundational advances and growing application demands in large-scale data analysis, bioinformatics, compressed data processing, and fine-grained complexity. Recent editions of the Combinatorial Pattern Matching (CPM) ans String Processing and Information Retrieval (SPIRE) conference and related special issues in algorithmic journals confirm sustained interest and rapid progress, with contributions spanning exact, approximate, and compressed pattern matching, as well as extensions to graphs and non-classical computational models. The current state of the art goes beyond classical string-matching algorithms by addressing scalability, compression, and complexity limits. Recent work introduces improved data structures for indexing and querying massive texts, new algorithms for pattern matching on compressed representations, tighter complexity bounds, and novel connections to fine-grained and even quantum complexity frameworks. The papers in this collection advance existing knowledge by refining theoretical bounds, extending pattern matching to richer models (e.g., grammar-compressed strings or graphs), and proposing algorithms that improve either asymptotic performance or practical efficiency. Their novelty lies in combining combinatorial insights with modern computational constraints, pushing the field beyond its traditional formulations. Guest editors: Prof. Golnaz Badkobeh - City St George’s University of London - UK Prof. Thierry Lecroq - University of Rouen Normandy - France Special issue information: - string pattern matching- data structures for string processing - text compression - text mining - compressed data structures - compressed string processing - combinatorics on words - pattern discovery - string algorithms - text searching and indexing Manuscript submission information: Authors should submit their manuscripts to the Theoretical Computer Science Editorial System (EM) at Submission site for Theoretical Computer Science, and select " VSI: Honoring Maxime Crochemore” when they reach the “Article Type” step in the submission process. General information for submitting papers to TCS can be found at Guide for Authors - Theoretical Computer Science. Final Manuscript Submission Deadline: 15th December 2026 Keywords: Strings, Combinatorics, Algorithms, repetitions https://www.sciencedirect.com/special-issue/333970/special-issue-in-honour-of-maxime-crochemore-80th-s-birthday
Last updated by Admin Agent on
Special Issue on Universality in Logics and Physics Submission Date: 2026-12-31 This special issue of Theoretical Computer Science, titled “Universality in Logics and Physics,” welcomes original contributions exploring the connections between logics, computation, and possibly physical theories. Topics include, but are not limited to, logical frameworks, proof systems interoperability, ecumenical proof libraries, automated deduction, quantum programming languages, and physics-inspired models of computation. Submissions presenting advances on the notion of universality across these domains are particularly encouraged. This issue aims to pay tribute — through science only — to the intellectual legacy of Gilles Dowek, whose work built bridges between these communities. Guest editors: Dr. Pablo Arrighi Inria Areas of Expertise: Quantum computing Prof. Frank Pfenning Carnegie Mellon University Areas of Expertise: Programming Languages, Logics Manuscript submission information: Authors should submit their manuscripts to the Theoretical Computer Science Editorial System (EM) at Submission site for Theoretical Computer Science, and select " VSI:UNILOP” when they reach the “Article Type” step in the submission process. General information for submitting papers to TCS can be found at Guide for Authors - Theoretical Computer Science. Final Manuscript Submission Deadline: 31st December 2026 Keywords: Interactive theorem proving, ecumenical logics, deduction modulo, unification, rewriting, type theory Natural computing, quantum computing, quantum programming languages, cellular automata https://www.sciencedirect.com/special-issue/328918/universality-in-logics-and-physics
Last updated by Dou Sun on
Special Issue on the 32nd International Computing and Combinatorics Conference Submission Date: 2026-12-31 This special issue presents special selection from the 32nd International Computing and Combinatorics Conference (COCOON 2026) held in Singapore during 23–25 July 2026. This conference is in the areas of algorithms, theory of computation, computational complexity, algorithmic game theory and combinatorics. Guest editors: Dr. Yi Li, Nanyang Technological University, Singapore Professor Frank Stephan, National University of Singapore, Singapore Professor Xiaoming Sun, Institute of Computing Technology Chinese Academy of Sciences, China Special issue information: The selected papers in this special issue were invited based on their evaluation by the COCOON 2026 program committee, and submitted in substantially polished journal versions to go through the standard rigorous refereeing process of the Theoretical Computer Science. Manuscript submission information: Authors should submit their manuscripts to the Theoretical Computer Science Editorial System (EM) at Submission site for Theoretical Computer Science, and select " VSI: COCOON 2026” when they reach the “Article Type” step in the submission process. General information for submitting papers to TCS can be found at Guide for Authors - Theoretical Computer Science. Final Manuscript Submission Deadline: 31st December 2026 Keywords: (approximation algorithms) OR (combinatorial optimization) OR (parameterized complexity) https://www.sciencedirect.com/special-issue/335302/special-issue-on-the-32nd-international-computing-and-combinatorics-conference
Last updated by Admin Agent on

People who viewed this also viewed

CCFFull NameImpact FactorPublisherISSN
CSignal Processing3.6Elsevier0165-1684

Related Journals

CCFFull NameImpact FactorPublisherISSN
Electronic Notes in Theoretical Computer ScienceElsevier1571-0661
Materials Science and Engineering: B5.7Elsevier0921-5107
Materials Science and Engineering: CElsevier0928-4931
BSoftware & Systems Modeling3.2Springer1619-1366
BPattern Recognition7.6Elsevier0031-3203
BIEEE Transactions on Neural Networks and Learning Systems8.9IEEE1045-9227
BInformation Sciences6.0Elsevier0020-0255
BComputer Networks4.7Elsevier1389-1286
BComputers & Security5.4Elsevier0167-4048
BIEEE Transactions on Intelligent Transportation Systems8.4IEEE1524-9050

Related Conferences

Comments 0

No comments yet.

Please Login to post a comment