ACM Transactions on Computation Theory

Scope & Guideline

Driving Innovation in Computational Theory and Mathematics.

Introduction

Explore the comprehensive scope of ACM Transactions on Computation Theory 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 ACM Transactions on Computation Theory in depth and align your research initiatives with current academic trends.
LanguageEnglish
ISSN1942-3454
PublisherASSOC COMPUTING MACHINERY
Support Open AccessNo
CountryUnited States
TypeJournal
Convergefrom 2009 to 2024
AbbreviationACM T COMPUT THEORY / ACM Trans. Comput. Theory
Frequency4 issues/year
Time To First Decision-
Time To Acceptance-
Acceptance Rate-
Home Page-
Address1601 Broadway, 10th Floor, NEW YORK, NY 10019-7434

Aims and Scopes

The ACM Transactions on Computation Theory focuses on the theoretical foundations of computation, exploring various aspects of complexity, algorithms, and their applications in computer science. The journal aims to publish high-quality research that advances the understanding of computational theory and its implications across diverse domains.
  1. Complexity Theory:
    Research in this area examines the inherent difficulty of computational problems, categorizing them into complexity classes and exploring relationships between these classes.
  2. Algorithm Design and Analysis:
    The journal publishes studies on the design and analysis of algorithms, including both classical and advanced techniques for solving computational problems efficiently.
  3. Parameterized and Exact Algorithms:
    A focus on parameterized complexity and exact algorithms, investigating the computational feasibility of problems based on certain parameters.
  4. Quantum Computing:
    Exploration of computational models based on quantum mechanics, including the complexity of quantum algorithms and their potential applications.
  5. Graph Theory and Combinatorial Structures:
    Research in this domain covers graph algorithms, combinatorial optimization, and the study of various combinatorial structures relevant to computation.
  6. Statistical and Probabilistic Methods:
    The journal addresses the use of statistical techniques in computational problems, including randomized algorithms and probabilistic analysis.
Recent publications in the ACM Transactions on Computation Theory indicate several emerging themes that reflect current trends in computational research. These themes highlight novel approaches, interdisciplinary connections, and the application of theory to practical problems.
  1. Spectral and Linear Algebra Techniques:
    An increasing number of papers utilize spectral methods and linear algebra to address problems in computational theory, signaling a trend towards leveraging these mathematical tools for algorithmic design.
  2. Quantum Algorithms and Complexity:
    The rise in research focused on quantum algorithms and their complexity indicates a growing interest in understanding the implications of quantum computing for traditional computational problems.
  3. Parameterized Complexity and Approximation:
    There is a notable trend towards exploring parameterized complexity and approximation algorithms, reflecting a shift in interest towards more nuanced problem-solving approaches in computational theory.
  4. Interdisciplinary Applications:
    Emerging themes show a focus on the application of computational theory to other fields such as machine learning, network theory, and data science, indicating a trend towards interdisciplinary research.
  5. Dynamic and Adaptive Algorithms:
    Research is increasingly focusing on dynamic algorithms that adapt to changing inputs, reflecting the need for algorithms that can efficiently handle real-time data.

Declining or Waning

While the journal covers a broad spectrum of computational theory, certain areas have seen a decline in focus over recent years. This may reflect shifts in research interests or the maturation of certain topics.
  1. Classical Complexity Classes:
    Research on traditional complexity classes like P, NP, and PSPACE has diminished, possibly due to a saturation of foundational results and a shift towards more nuanced or applied aspects of complexity.
  2. Basic Graph Algorithms:
    While still important, basic graph algorithms have become less prevalent as researchers move towards more complex and nuanced algorithmic challenges that involve broader computational frameworks.
  3. Static Models of Computation:
    Static models have seen a reduction in focus as dynamic and adaptive computation models gain prominence, reflecting the evolving nature of computational problems in real-world applications.

Similar Journals

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

Connecting Theory with Practice in Computer Science and Discrete Mathematics
Publisher: DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCEISSN: 1462-7264Frequency: 4 issues/year

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, published by DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE in France, stands as a significant open-access journal since 1997, publishing innovative research articles within the intersecting disciplines of discrete mathematics and theoretical computer science. With an ISSN of 1462-7264 and an E-ISSN of 1365-8050, this journal aims to provide a platform for scholarly discourse and dissemination of knowledge, making it accessible to a global audience. It is recognized for its contributions, achieving a Q2 ranking in both Computer Science (Miscellaneous) and Discrete Mathematics and Combinatorics, alongside a Q3 ranking in Theoretical Computer Science as of 2023. The journal’s rigorous selection process ensures that only high-quality research is published, promoting advancements in these critical areas of study. Researchers, professionals, and students alike can benefit from its comprehensive articles that not only enhance theoretical understanding but also foster practical applications in the ever-evolving landscape of computer science.

ALGORITHMICA

Exploring Innovative Solutions in Algorithm Design
Publisher: SPRINGERISSN: 0178-4617Frequency: 12 issues/year

ALGORITHMICA is a premier academic journal published by SPRINGER, dedicated to the field of algorithms and their applications across various domains. With an ISSN of 0178-4617 and an E-ISSN of 1432-0541, this journal serves as a vital resource for researchers and practitioners interested in the theoretical and practical aspects of algorithmic design and analysis. Recognized for its high impact, ALGORITHMICA is listed in the top quartile (Q1) for Applied Mathematics and Computer Science (miscellaneous) and is positioned in Q2 for Computer Science Applications in the 2023 category rankings. The journal has continuously contributed to advancing knowledge from its inception in 1986 to its ongoing publications through 2024. With a commitment to rigorous peer review and high-quality research, ALGORITHMICA is essential for anyone serious about pushing the boundaries of algorithmic study and application.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

Advancing the Foundations of Computer Science
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

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.

SIAM JOURNAL ON DISCRETE MATHEMATICS

Connecting theory with impactful applications.
Publisher: SIAM PUBLICATIONSISSN: 0895-4801Frequency: 4 issues/year

SIAM Journal on Discrete Mathematics is a premier academic journal dedicated to the publication of high-quality research in the field of discrete mathematics. Published by SIAM Publications, this journal features original research articles covering a broad range of topics, including combinatorial optimization, graph theory, and algorithm design. With an impressive impact factor placing it in the top quartile (Q1) of mathematics journals, it is a valuable resource for researchers and practitioners looking to stay abreast of the latest advancements in discrete mathematics. Although currently not open access, the journal commits to disseminating rigorous and impactful findings that advance the understanding of mathematical concepts and their applications in various scientific domains. Renowned for its rigorous peer-review process, the SIAM Journal on Discrete Mathematics serves as an essential platform for scholars aiming to contribute to this evolving field, making it a must-read for anyone involved in mathematical research.

Theoretical Computer Science

Pioneering Insights in Computational Frameworks
Publisher: ELSEVIERISSN: 0304-3975Frequency: 48 issues/year

Theoretical Computer Science, published by Elsevier, serves as a pivotal platform in the field of computational theory, exploring the foundational aspects of computer science and mathematical logic since its inception in 1975. With both a print ISSN of 0304-3975 and an E-ISSN of 1879-2294, this journal is esteemed for its rigorous peer-review process and commitment to advancing knowledge in theoretical frameworks and algorithms. Positioned in the Q2 quartile for both Computer Science (miscellaneous) and Theoretical Computer Science categories, it ranks #124 out of 232 in general computer science and #73 out of 130 in theoretical computer science according to Scopus metrics, reflecting its significant influence and reach within the academic community. Researchers and professionals can access this journal through institutional subscriptions, providing a plethora of high-quality articles that contribute to ongoing debates and developments in the discipline. The journal's scope encompasses a wide array of topics, ensuring relevance across various subfields, thus making it an essential resource for anyone dedicated to furthering their understanding of theoretical computer science.

COMBINATORICA

Exploring the Depths of Discrete Mathematics Excellence
Publisher: SPRINGER HEIDELBERGISSN: 0209-9683Frequency: 6 issues/year

COMBINATORICA, published by Springer Heidelberg, is a leading international journal dedicated to advancing the fields of Discrete Mathematics and Combinatorics. With an illustrious history dating back to 1981 and a remarkable commitment to excellence, this journal has earned its place in the highest echelons of academic publishing, currently ranked in the Q1 category for both Computational Mathematics and Discrete Mathematics and Combinatorics. Located in Germany and recognized for its high-quality research contributions, COMBINATORICA fosters innovative discussions and disseminates significant findings that shape contemporary mathematical theory. Although it does not offer Open Access options, its rigorous peer-review process ensures that each publication meets the highest scholarly standards, making it an essential resource for researchers, professionals, and students engaged in mathematical sciences. With an impactful H-Index reflecting its citation influence, COMBINATORICA continues to be a pivotal platform for groundbreaking research in combinatorics and its applications.

Discrete Optimization

Pioneering Research in Discrete Optimization Strategies
Publisher: ELSEVIERISSN: 1572-5286Frequency: 4 issues/year

Discrete Optimization is a leading academic journal published by Elsevier, focusing on the pivotal field of discrete optimization, which plays a crucial role in various domains including applied mathematics, computational theory, and theoretical computer science. With its ISSN 1572-5286 and E-ISSN 1873-636X, the journal offers a platform for researchers to disseminate their findings and contribute to the advancement of knowledge in discrete methodologies and algorithmic strategies. Discrete Optimization has demonstrated a steady path of progress, recognized in 2023 with a Q3 quartile ranking across applied mathematics, computational theory, and theoretical computer science categories, indicating it is a respected journal within these competitive fields. Although currently a subscription-based journal, it continues to inspire innovative research and offers valuable insights for researchers, professionals, and students alike. The journal serves as an essential resource for those seeking to deepen their understanding and application of optimization techniques, contributing to the ongoing evolution of the discipline.

THEORY OF COMPUTING SYSTEMS

Unraveling the Mysteries of Computational Theory
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.

JOURNAL OF COMBINATORIAL THEORY SERIES B

Connecting Scholars Through Cutting-edge Research
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.