Theory of Computing

Scope & Guideline

Shaping the Future of Computer Science Scholarship

Introduction

Delve into the academic richness of Theory of Computing with our guidelines, detailing its aims and scope. Our resource identifies emerging and trending topics paving the way for new academic progress. We also provide insights into declining or waning topics, helping you stay informed about changing research landscapes. Evaluate highly cited topics and recent publications within these guidelines to align your work with influential scholarly trends.
LanguageEnglish
ISSN1557-2862
PublisherUNIV CHICAGO, DEPT COMPUTER SCIENCE
Support Open AccessNo
CountryUnited States
TypeJournal
Converge2005, from 2014 to 2024
AbbreviationTHEOR COMPUT / Theory Comput.
Frequency1 issue/year
Time To First Decision-
Time To Acceptance-
Acceptance Rate-
Home Page-
Address1100 E 58TH ST, CHICAGO, IL 60637

Aims and Scopes

The journal 'Theory of Computing' focuses on theoretical aspects of computer science, emphasizing mathematical foundations, complexity theory, and algorithms. It serves as a platform for disseminating significant advances in the understanding of computational processes, providing insights into both classical and quantum computing domains.
  1. Complexity Theory:
    A central theme in the journal, exploring the classifications of computational problems based on their inherent difficulty and the resources required to solve them. This includes work on NP-completeness, hardness of approximation, and quantum complexity classes.
  2. Algorithms and Data Structures:
    Research that delves into algorithm design, analysis, and the development of efficient data structures. Topics include approximation algorithms, randomized algorithms, and algorithms for specific problem classes such as flow networks and graph algorithms.
  3. Quantum Computing:
    An emerging area of focus reflecting the journal's commitment to advancing the understanding of quantum computation. This includes studies on quantum algorithms, quantum complexity classes, and the implications of quantum mechanics on computational theory.
  4. Pseudorandomness and Derandomization:
    Research aimed at understanding the role of randomness in computation and developing methods to simulate randomness deterministically. This includes pseudorandom generators, derandomization techniques, and their applications in algorithm design.
  5. Graph Theory and Combinatorial Structures:
    The journal features works that investigate the properties and complexities of various combinatorial structures, particularly graphs. This includes intersection problems, communication complexity in graph settings, and the study of network flows.
Recent publications in 'Theory of Computing' highlight several emerging themes that reflect the evolving landscape of theoretical computer science. These trends indicate a growing interest in areas that intersect with contemporary technological challenges and advancements.
  1. Verifiable Quantum Computation:
    With a rising number of publications addressing quantum computation, particularly in the context of verifiable delegated quantum computation, this theme is gaining traction. The relevance lies in the increasing importance of quantum technologies and the need for trust in quantum systems.
  2. Randomized Query Complexity:
    A notable trend is the exploration of randomized query complexity, emphasizing the efficiency of algorithms in terms of query access to data structures. This area is crucial as it impacts various applications in data analysis and machine learning.
  3. Communication Complexity:
    There is a growing focus on communication complexity, particularly in multi-party settings and its applications to data streams. This is relevant in the context of distributed computing and networked systems, reflecting current technological trends.
  4. Derandomization and Pseudorandomness Advances:
    The emphasis on new techniques for derandomization and the construction of pseudorandom generators is increasing. These advancements hold significance for improving algorithmic efficiency and reducing reliance on randomness in computational processes.

Declining or Waning

While the journal maintains a strong focus on various aspects of theoretical computing, certain themes have shown a decline in prominence over recent years. These areas, while still relevant, appear less frequently in the latest publications.
  1. Classical Algorithms without Randomization:
    There has been a noticeable reduction in publications focusing solely on classical deterministic algorithms. This shift may reflect a broader interest in randomized and quantum algorithms, which are perceived as more impactful in current research.
  2. Lower Bounds in Classical Complexity:
    Research specifically addressing lower bounds in classical computational complexity has become less frequent. While foundational, this area may be overshadowed by newer methodologies and frameworks that offer broader implications and insights.
  3. Algebraic Methods in Complexity Theory:
    Though still important, the focus on purely algebraic approaches to complexity problems seems to have waned. The field is increasingly integrating techniques from other areas, such as combinatorics and geometry, leading to a more interdisciplinary approach.

Similar Journals

THEORY OF COMPUTING SYSTEMS

Pioneering Research in Theoretical Computer Science
Publisher: SPRINGERISSN: 1432-4350Frequency: 6 issues/year

THEORY OF COMPUTING SYSTEMS, published by SPRINGER, is a renowned journal that has been a cornerstone in the fields of computational theory and theoretical computer science since its inception in 1996. With an ISSN of 1432-4350 and an E-ISSN of 1433-0490, this journal is committed to disseminating high-quality research that explores the underlying principles of computing systems and their theoretical foundations. Positioned in the Q2 category for both Computational Theory and Mathematics and Theoretical Computer Science, it plays a vital role in advancing scholarly dialogue and innovation within these disciplines, as evidenced by its rankings within the Scopus index. Researchers and professionals can access this journal in various formats, ensuring that cutting-edge research is readily available for a global audience. With a clear focus on fostering interdisciplinary collaboration and exploring emerging trends, THEORY OF COMPUTING SYSTEMS is essential reading for anyone interested in the evolution of computing theory and its applications.

Australasian Journal of Combinatorics

Advancing the Frontiers of Discrete Mathematics
Publisher: CENTRE DISCRETE MATHEMATICS & COMPUTINGISSN: 2202-3518Frequency: 3 issues/year

The Australasian Journal of Combinatorics, published by the CENTRE DISCRETE MATHEMATICS & COMPUTING, serves as a vital platform for researchers and professionals engaged in the dynamic field of discrete mathematics and combinatorics. With an ISSN of 2202-3518 and an E-ISSN of the same, this journal has been committed to open access since 2014, ensuring that groundbreaking research is readily available to a global audience. Based in Australia, specifically at the Department of Mathematics, University of Queensland, this journal spans the years from 1996 to 2024, showcasing the evolution of combinatorial research over nearly three decades. Recognized in the 2023 category quartiles as Q3 in Discrete Mathematics and Combinatorics, it ranks 68th out of 92 in Scopus, reflecting its growing influence despite its current percentile of 26th. The Australasian Journal of Combinatorics is dedicated to fostering innovative research and theoretical development, making it a valuable resource for academics and students alike.

Problems of Information Transmission

Pioneering Research in Transmission Technologies
Publisher: PLEIADES PUBLISHING INCISSN: 0032-9460Frequency: 4 issues/year

Problems of Information Transmission, an esteemed journal published by PLEIADES PUBLISHING INC, serves as a critical platform for scholarly discourse in the fields of computer networks, communications, computer science applications, and information systems. Established in 1972 and resuming publication from 2005 to 2024, this journal provides a rigorous peer-reviewed environment for researchers to present their findings, methodologies, and innovative applications. With a noteworthy impact factor and categorized as Q3 in several relevant fields in 2023, it ranks within the 30th percentile amongst its peers, indicating its established presence in the academic community. Although the journal is not open access, it remains an essential resource for professionals and students seeking to explore contemporary challenges and advancements in information transmission. For those pursuing knowledge in these dynamic areas, Problems of Information Transmission represents a significant and authoritative source of cutting-edge research and insights.

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS

Navigating the Evolving Landscape of Computer Science.
Publisher: EDP SCIENCES S AISSN: 0988-3754Frequency: 1 issue/year

RAIRO - Theoretical Informatics and Applications is a renowned academic journal published by EDP Sciences S A that has been at the forefront of disseminating innovative research and applications in the fields of computer science and mathematics since its inception in 1995. With a focus on theoretical and applied aspects of informatics, the journal serves as a vital resource for researchers and professionals seeking to explore the intricacies of computational theories and their practical applications. Although currently lacking an Open Access model, it provides invaluable insights from distinguished researchers within its Q4 category rankings across its pertinent fields. As reflected in its Scopus rankings, including a position in the 24th percentile for General Mathematics and the 9th percentile for Computer Science Applications, RAIRO is pivotal in contributing to the ongoing discourse and advancements in theoretical informatics. Researchers, professionals, and students will find this journal critical in understanding emerging trends and challenges in the rapidly evolving domains of computer science and mathematics.

Logical Methods in Computer Science

Empowering discoveries at the intersection of logic and computation.
Publisher: LOGICAL METHODS COMPUTER SCIENCE E VISSN: 1860-5974Frequency:

Logical Methods in Computer Science is a premier Open Access journal dedicated to fostering scholarly dialogue within the realms of Computer Science and Theoretical Computer Science. Established in 2004 and published by LOGICAL METHODS COMPUTER SCIENCE E V in Germany, this journal aims to bridge theoretical frameworks and practical applications, providing a platform for innovative research and discoveries. With an impressive HIndex reflecting its commitment to high-quality research, Logical Methods in Computer Science has achieved a Q2 ranking in both the miscellaneous and theoretical categories of computer science, indicating its growing influence in the academic community. Researchers, professionals, and students are encouraged to access and engage with the wealth of knowledge this journal offers, which is freely accessible to facilitate widespread dissemination of cutting-edge advancements in logical methods. With its convergence period extending from 2005 to 2024, Logical Methods in Computer Science continues to be a vital resource for those looking to explore the intersections of logic, computation, and mathematics.

JOURNAL OF COMBINATORIAL THEORY SERIES B

Exploring the Depths of Discrete Mathematics
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCEISSN: 0095-8956Frequency: 6 issues/year

JOURNAL OF COMBINATORIAL THEORY SERIES B, published by Academic Press Inc., Elsevier Science, is an esteemed journal within the discipline of combinatorial theory, discrete mathematics, and theoretical computer science. With a rich history since its inception in 1971 and ongoing publication through 2025, this journal has established itself as a pillar in its field, currently holding Q1 category rankings in multiple areas including Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, and Theoretical Computer Science. The journal features cutting-edge research and developments, attracting contributions from both established professionals and emerging scholars. Despite the absence of an open access option, the journal's strong impact reflected in its Scopus ranks—such as being number 16 out of 92 in Discrete Mathematics and Combinatorics (83rd percentile)—signifies its influential role in advancing knowledge and innovation. Researchers seeking to share impactful findings and connect with a vibrant academic community will find the JOURNAL OF COMBINATORIAL THEORY SERIES B an essential resource.

INFORMATION PROCESSING LETTERS

Connecting Scholars through Rigorous Research
Publisher: ELSEVIERISSN: 0020-0190Frequency: 12 issues/year

INFORMATION PROCESSING LETTERS, published by ELSEVIER and with an ISSN of 0020-0190, is a prominent academic journal that serves as a vital resource in the fields of Computer Science, Information Systems, and Signal Processing, among others. As evidenced by its Q3 ranking across various categories in 2023, including Computer Science Applications and Theoretical Computer Science, it provides a rigorous platform for the dissemination of innovative research and theoretical developments. Researchers and professionals can delve into a wide array of subjects pertinent to information processing, contributing to advancements in technology and data management. Although it does not offer Open Access options, the journal maintains an influential presence in scholarly discourse, making it a crucial reference for those engaged in computational innovations and system optimizations. With coverage from 1971 to 2025, it continues to be integral for both seasoned academics and emerging scholars.

International Journal of Mathematics and Computer Science

Bridging Theory and Application in Mathematics and Computing
Publisher: LEBANESE UNIVISSN: 1814-0424Frequency: 2 issues/year

The International Journal of Mathematics and Computer Science (ISSN: 1814-0424, E-ISSN: 1814-0432), published by Lebanese University, serves as a vital platform for disseminating innovative research and advancements in the fields of mathematics and computer science. With a compelling range of topics including Algebra, Applied Mathematics, Computational Mathematics, and Statistical Analysis, this journal caters to a broad audience of researchers, professionals, and students. Spanning the years from 2017 to 2025, it has established a presence in several key quartiles, including Q3 rankings in Applied Mathematics and Computational Mathematics, and a Q4 ranking in Algebra and Number Theory. While currently not an open-access journal, it provides valuable insights through its rigorous peer-reviewed process, enhancing its relevance in both theoretical and applied domains. Furthermore, its presence in Scopus rankings reflects its commitment to quality, making it an essential resource for anyone looking to explore the intersection of mathematics and computer science.

INFORMATION AND COMPUTATION

Advancing the Frontiers of Computational Knowledge
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCEISSN: 0890-5401Frequency: 6 issues/year

INFORMATION AND COMPUTATION is a peer-reviewed academic journal published by Academic Press Inc., Elsevier Science, dedicated to advancing the fields of computational theory and mathematics, computer science applications, and information systems. With an ISSN of 0890-5401 and an E-ISSN of 1090-2651, the journal provides a platform for innovative research that spans theoretical and applied perspectives. Acknowledged for its impact in the community, it holds a Q2 quartile ranking in several categories, including Computational Theory and Mathematics and Computer Science Applications, as of 2023. These rankings place it among the leading journals in its field, making it an essential resource for researchers, professionals, and students aiming to stay abreast of cutting-edge developments. While it does not currently offer Open Access options, the journal intends to foster scholarly communication and knowledge sharing from its inception in 1987 to its future issues expected through 2024. Located in the United States, at 525 B ST, STE 1900, SAN DIEGO, CA 92101-4495, INFORMATION AND COMPUTATION is committed to publishing high-quality research that influences the theoretical foundations and practical applications of its diverse disciplines.

COMPUTATIONAL COMPLEXITY

Advancing the Frontiers of Computational Theory
Publisher: SPRINGER BASEL AGISSN: 1016-3328Frequency: 1 issue/year

COMPUTATIONAL COMPLEXITY is a pivotal peer-reviewed journal published by SPRINGER BASEL AG, dedicated to advancing the field of computational theory and mathematics. Established as a key resource since its inception in 1991, the journal's scope encompasses significant areas including computational complexity, algorithmic processes, and mathematical innovations that shape theoretical computer science. With an impressive history of dissemination and influence, it holds a 2023 category quartile ranking of Q2 and Q3 across various mathematics and computer science disciplines, indicating its substantial contribution to academic discourse. Notably, researchers and practitioners should be aware that while the journal is not an open-access publication, it remains accessible via institutional subscriptions and may include selective open-access options for individual articles. By fostering rigorous scholarly communication, COMPUTATIONAL COMPLEXITY continues to attract a diverse readership of academics, professionals, and students who are keen to explore emerging trends and foundational theories in this dynamic field.