저널 정보

Theoretical Computer Science (TCS)

저널 웹사이트를 보려면 로그인해 주세요
무료 가입으로 공식 사이트 조회, 마감 추적, 이메일 리마인더를 이용할 수 있습니다.
회원가입 로그인
이 데이터를 API로 가져오기
검색과 순위 목록은 자격 증명이 전혀 필요 없습니다. 이 페이지의 상세 데이터에는 무료 API 키가 필요합니다. 자세한 내용은 개발자 안내 페이지를 참고하세요.
영향력 지수:
1.1
출판사:
Elsevier
ISSN:
0304-3975
조회:
40325
팔로우:
26

논문 모집

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.
최종 수정: Admin Agent ()

Special Issues

Special Issue on Fun with Algorithms 2026 투고 마감일: 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
최종 수정: Admin Agent ()
Special Issue on the 5th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2026) 투고 마감일: 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
최종 수정: Admin Agent ()
Special Issue on Honour of Maxime Crochemore 80th’s Birthday 투고 마감일: 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
최종 수정: Admin Agent ()
Special Issue on Universality in Logics and Physics 투고 마감일: 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
최종 수정: Dou Sun ()
Special Issue on the 32nd International Computing and Combinatorics Conference 투고 마감일: 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
최종 수정: Admin Agent ()

이 항목을 본 사람들이 함께 본 항목

CCF정식 명칭영향력 지수출판사ISSN
CSignal Processing3.6Elsevier0165-1684

관련 저널

CCF정식 명칭영향력 지수출판사ISSN
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

관련 학회

CCFICORECP-I약칭정식 명칭투고 마감개최일
BA*89.6ICRAInternational Conference on Robotics and Automation2026-09-152027-05-24
BA*94.0IJCAIInternational Joint Conference on Artificial Intelligence2026-01-312026-08-15
B91.1ICASSPInternational Conference on Acoustics, Speech and Signal Processing2026-09-162027-05-16
BA*79.4PODSACM SIGMOD Conference on Principles of DB Systems2026-12-032027-06-13
BA76.4ICMEInternational Conference on Multimedia and Expo2025-12-312026-07-05
B84.4BIBMInternational Conference on Bioinformatics & Biomedicine2026-07-052026-12-01
BA*94.1ICDMInternational Conference on Data Mining2026-06-062026-11-12
BA*89.0ECCVEuropean Conference on Computer Vision2026-03-062026-09-08
BA92.8DATEDesign, Automation and Test in Europe2026-09-072027-03-22
BA*83.8KRInternational Conference on the Principles of Knowledge Representation and Reasoning2026-02-082026-07-20

댓글 0

아직 댓글이 없습니다.

댓글을 작성하려면 로그인해 주세요