Theory of Computing

Scope & Guideline

Innovating Ideas for Tomorrow's Computing Challenges

Introduction

Explore the comprehensive scope of Theory of Computing through our detailed guidelines, including its aims and scope. Stay updated with trending and emerging topics, and delve into declining areas to understand shifts in academic interest. Our guidelines also showcase highly cited topics, featuring influential research making a significant impact. Additionally, discover the latest published papers and those with high citation counts, offering a snapshot of current scholarly conversations. Use these guidelines to explore Theory of Computing in depth and align your research initiatives with current academic 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

International Journal of Mathematics and Computer Science

Fostering Excellence in Mathematical and Computational Research
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.

Logical Methods in Computer Science

Bridging logic and innovation in computer science.
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.

International Journal of Computer Mathematics- Computer Systems Theory

Exploring New Horizons in Computational Research
Publisher: TAYLOR & FRANCIS LTDISSN: 2379-9927Frequency: 4 issues/year

International Journal of Computer Mathematics - Computer Systems Theory, published by Taylor & Francis Ltd, is a vital resource in the fields of computational mathematics and computer systems theory. With an ISSN of 2379-9927 and E-ISSN 2379-9935, this journal has established a prominent presence in academia since its inception in 2016. It is categorized in the Q3 quartile for both Computational Mathematics and Computational Theory in 2023, reflecting its impact and contribution to the scholarly discourse within these domains. The journal’s Scopus rankings further emphasize its academic relevance, placing it in the 38th and 33rd percentiles in their respective categories. International Journal of Computer Mathematics aims to disseminate innovative research findings, methodologies, and theoretical advancements, making it an essential publication for researchers, professionals, and students looking to deepen their understanding of computational methods and applications. Although it currently does not offer open access, the journal continues to provide insightful contributions to the scientific community, fostering the evolution of computational sciences.

ACM Transactions on Computation Theory

Transforming Ideas into Theory: The Future of Computation.
Publisher: ASSOC COMPUTING MACHINERYISSN: 1942-3454Frequency: 4 issues/year

ACM Transactions on Computation Theory, published by the Association for Computing Machinery, is a prestigious journal dedicated to advancing the field of computation theory and theoretical computer science. With an ISSN of 1942-3454 and an E-ISSN of 1942-3462, this journal serves as a vital resource for researchers and professionals seeking to explore groundbreaking developments in computational models, algorithms, and their mathematical foundations. The journal's rigorous standards have earned it a significant position within the academic community, as evidenced by its 2023 category quartiles, ranking in the Q1 category for Computational Theory and Mathematics and Q2 for Theoretical Computer Science. Although it operates through traditional subscription access, it maintains a critical role in disseminating cutting-edge research and fostering collaboration among experts in the United States and beyond. As an influential platform, ACM Transactions on Computation Theory is committed to contributing to the ongoing dialogue and advancement of computation theory, making it essential reading for anyone passionate about this dynamic field.

ACM Transactions on Algorithms

Unraveling Complexities with Cutting-edge Algorithms
Publisher: ASSOC COMPUTING MACHINERYISSN: 1549-6325Frequency: 4 issues/year

ACM Transactions on Algorithms (ISSN: 1549-6325, E-ISSN: 1549-6333) is an esteemed academic journal published by the Association for Computing Machinery (ACM), dedicated to advancing the field of algorithms within the broad domain of mathematics. With an impressive 2023 Quartile Ranking of Q1 in Mathematics (miscellaneous) and a Scopus rank placing it in the 15th percentile of its category, this journal is a pivotal resource for researchers, professionals, and students alike. Covering topics from algorithm design and analysis to applications in diverse areas, it serves as a platform for publishing high-quality, peer-reviewed research that significantly contributes to theoretical advancements and practical implementations. Although it is not an open-access journal, its impact in the academic community is profound, ensuring that vital findings reach a wide audience while promoting innovation and excellence in algorithm research. Established in 2005, with contributions continuing through 2024, ACM Transactions on Algorithms remains at the forefront of its field, underpinning significant developments and collaborations in algorithmic research.

Bulletin of the European Association for Theoretical Computer Science

Pioneering Research in Theoretical Computer Science
Publisher: EUROPEAN ASSOC THEORETICAL COMPUTER SCIENCEISSN: 0252-9742Frequency: 3 issues/year

Bulletin of the European Association for Theoretical Computer Science is a distinguished journal dedicated to the field of theoretical computer science, published by the European Association for Theoretical Computer Science. With its focus on theoretical underpinnings, algorithmic framework, and the advancement of computational theories, this journal serves as a crucial platform for researchers, professionals, and students alike. While not an open access journal, it offers vital insights and findings that significantly contribute to the academic community in theoretical computer science. The journal is headquartered in Greece, at the Computer Technology Institute and Press-CTI in Rio, symbolizing a rich tradition of scholarly exchange within the European context. Researchers aiming to disseminate their work in this niche yet impactful area will find the Bulletin's blend of rigor and relevance invaluable as they seek to push the boundaries of knowledge in computational theory.

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS

Advancing Knowledge in Computer Science and Mathematics.
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.

INFORMATION PROCESSING LETTERS

Innovating the Future of Computational Science
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 FOUNDATIONS OF COMPUTER SCIENCE

Building the Future on Solid Computational Foundations
Publisher: WORLD SCIENTIFIC PUBL CO PTE LTDISSN: 0129-0541Frequency: 6 issues/year

The International Journal of Foundations of Computer Science, published by World Scientific Publishing Co Pte Ltd, is a premier repository for cutting-edge research in the field of computer science, emphasizing foundational theories and methodologies. With an ISSN of 0129-0541 and an E-ISSN of 1793-6373, this journal has established itself as a valuable resource since its inception in 2000, continuously contributing to scholarly discourse up to the present year, 2024. It is ranked in the Q2 quartile of computer science categories, indicating its notable impact and relevance within the academic community, particularly in miscellaneous subsections of the field. While it does not currently offer open access options, it remains a crucial platform for researchers, professionals, and students seeking to deepen their understanding of computational foundations, algorithms, and theoretical frameworks. The journal encourages submissions that push the boundaries of knowledge and invites innovative approaches that address contemporary challenges in computer science.

Australasian Journal of Combinatorics

Empowering Scholars in 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.