ACM Transactions on Algorithms

Scope & Guideline

Advancing the Frontiers of Algorithmic Knowledge

Introduction

Welcome to the ACM Transactions on Algorithms information hub, where our guidelines provide a wealth of knowledge about the journal’s focus and academic contributions. This page includes an extensive look at the aims and scope of ACM Transactions on Algorithms, highlighting trending and emerging areas of study. We also examine declining topics to offer insight into academic interest shifts. Our curated list of highly cited topics and recent publications is part of our effort to guide scholars, using these guidelines to stay ahead in their research endeavors.
LanguageEnglish
ISSN1549-6325
PublisherASSOC COMPUTING MACHINERY
Support Open AccessNo
CountryUnited States
TypeJournal
Convergefrom 2005 to 2024
AbbreviationACM T ALGORITHMS / ACM Trans. Algorithms
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 Algorithms focuses on the theoretical aspects of algorithms, emphasizing rigorous analysis and innovative algorithm design. The journal aims to disseminate high-quality research that significantly contributes to the fields of algorithmic theory and its applications.
  1. Algorithmic Complexity and Efficiency:
    Research that explores the complexity of algorithms, including fine-grained complexity, approximation algorithms, and lower bounds, is a core focus. This area addresses how efficiently problems can be solved and the inherent limitations of various algorithmic approaches.
  2. Graph Algorithms and Combinatorial Structures:
    Many papers delve into algorithms related to graph theory, such as graph homomorphisms, network design, and various matching problems. This includes studying the properties of graphs and how these properties can be leveraged to design efficient algorithms.
  3. Data Structures and Their Applications:
    The journal frequently publishes work on innovative data structures that optimize various computational tasks. This includes dynamic data structures, efficient querying, and memory-efficient algorithms, which are critical for performance in algorithm design.
  4. Parameterized Complexity and Approximation:
    Research focused on parameterized algorithms and approximation schemes is prevalent, with a strong emphasis on how specific problem parameters can affect algorithm performance, particularly in NP-hard scenarios.
  5. Online and Streaming Algorithms:
    The journal also covers algorithms designed for online and streaming contexts, which are becoming increasingly relevant in handling large-scale data and real-time processing.
The ACM Transactions on Algorithms has seen a shift in focus towards several emerging themes that reflect the evolving landscape of algorithmic research.
  1. Fine-Grained Complexity:
    There is a notable increase in research addressing fine-grained complexity, which analyzes the exact complexity of problems and the relationships between different complexity classes. This trend reflects a growing interest in understanding the nuances of algorithm performance.
  2. Algorithms for Machine Learning and Data Science:
    Emerging themes include algorithms tailored for machine learning and data science applications, highlighting the intersection of algorithm design with practical data challenges. This includes advancements in sampling, clustering, and optimization techniques.
  3. Robust and Adaptive Algorithms:
    Recent publications show a trend towards developing algorithms that are robust against uncertainties and adapt to varying conditions, particularly in real-world applications such as network design and data processing.
  4. High-Dimensional Data Processing:
    As data grows in complexity and dimensionality, there is an increasing focus on algorithms that efficiently handle high-dimensional data, particularly in areas like clustering and nearest neighbor searches.

Declining or Waning

While ACM Transactions on Algorithms has a diverse range of topics, certain areas appear to be less frequently addressed in recent publications, indicating a potential decline in focus.
  1. String Matching Algorithms:
    Although string matching was once a prominent topic, recent titles suggest a waning interest in this area, with fewer novel contributions and advancements being published compared to previous years.
  2. Geometric Algorithms:
    Research on geometric algorithms, particularly those involving convex sets and geometric optimization, has seen a decrease. This shift may be due to a saturation of foundational results or a move towards more abstract algorithmic challenges.
  3. Randomized Algorithms:
    The frequency of papers specifically focusing on randomized algorithms has diminished, indicating a shift towards more deterministic approaches or other algorithmic paradigms that are currently in vogue.

Similar Journals

ALGORITHMICA

Unveiling the Power of Algorithms Across Disciplines
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.

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.

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE

Advancing mathematical innovation through software excellence.
Publisher: ASSOC COMPUTING MACHINERYISSN: 0098-3500Frequency: 4 issues/year

Welcome to the ACM Transactions on Mathematical Software, a prestigious journal published by the Association for Computing Machinery (ACM). With an ISSN of 0098-3500 and an E-ISSN of 1557-7295, this journal has been at the forefront of innovation in the field since its inception in 1975. It serves as a critical platform for researchers, professionals, and students, facilitating the dissemination of advanced mathematical techniques and software developments. The journal is recognized for its outstanding impact, evidenced by its Q1 classification in Applied Mathematics and Q2 in Software for 2023, along with an impressive Scopus ranking placing it in the 85th percentile for Applied Mathematics and the 58th percentile for Computer Science. Our objective is to publish high-quality research that explores new methodologies in mathematical software and their applications, driving the field forward. Although not an open access journal, the relevance and rigor of the content ensure that it remains a valuable resource in mathematical and computational sciences. Join us in exploring the latest in mathematical software and contribute to shaping future advancements.

JOURNAL OF GRAPH THEORY

Connecting Ideas Through Rigorous Peer Review
Publisher: WILEYISSN: 0364-9024Frequency: 12 issues/year

JOURNAL OF GRAPH THEORY, published by WILEY, stands as a pivotal resource in the fields of Discrete Mathematics and Combinatorics, as well as Geometry and Topology. Since its inception in 1977, this esteemed journal has fostered the dissemination of influential research, currently categorized in the prestigious Q1 quartile according to the latest metrics for 2023. With an ISSN of 0364-9024 and an E-ISSN of 1097-0118, it caters to a global readership of researchers, professionals, and students dedicated to advancing their knowledge in graph theory. By maintaining a strong rank in Scopus—39th out of 106 in Geometry and Topology, and 38th out of 92 in Discrete Mathematics and Combinatorics—it reflects its significance and impact within the academic community. Although it does not offer open-access options, its rigorous peer-review process ensures that only high-quality original research is published, thus reinforcing its reputation as a leading journal in this mathematical domain.

DISTRIBUTED COMPUTING

Shaping the Future of Distributed Technologies
Publisher: SPRINGERISSN: 0178-2770Frequency: 4 issues/year

DISTRIBUTED COMPUTING is a prestigious journal published by SPRINGER that has been a significant contributor to the fields of computational theory, computer networks, and hardware architecture since its inception in 1986. With its ISSN 0178-2770 and E-ISSN 1432-0452, this scholarly publication stands out for its rigorous peer-review process and its commitment to advancing knowledge in distributed systems. The journal has consistently ranked in the Q1 category for multiple relevant domains, reflecting its high impact within the academic community. Although not an open-access journal, DISTRIBUTED COMPUTING offers essential insights and research contributions that are invaluable to researchers, professionals, and students alike. Its scope encompasses various aspects of computational theory and mathematics, ensuring a comprehensive approach to the complexities of distributed systems. With an address in New York, USA, and a delivery timeline extending to 2024, this journal is poised to continue influencing the landscape of computer science and beyond.

SIAM JOURNAL ON DISCRETE MATHEMATICS

Exploring the depths of combinatorial brilliance.
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.

RANDOM STRUCTURES & ALGORITHMS

Exploring the Nexus of Randomness and Computation
Publisher: WILEYISSN: 1042-9832Frequency: 8 issues/year

RANDOM STRUCTURES & ALGORITHMS is a prestigious journal published by Wiley that stands at the forefront of research in the realms of applied mathematics, computer graphics, and algorithms. With a notable Impact Factor, it has consistently maintained a Q1 ranking across several categories including Applied Mathematics and Software, showcasing its significant contribution to these fields. The journal, which has been in circulation since 1990, serves as a vital resource for researchers, professionals, and students keen on exploring the complex interplay between randomness and computational efficiency. Although it operates under a traditional access model, the quality and relevance of the content ensure it attracts a broad readership eager to engage with cutting-edge studies and innovative solutions. For those looking to stay at the cutting edge of developments in random structures and algorithms, RANDOM STRUCTURES & ALGORITHMS is an essential journal that continues to shape the landscape of contemporary research.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES

Pioneering insights in computer science and systems analysis.
Publisher: ACADEMIC PRESS INC ELSEVIER SCIENCEISSN: 0022-0000Frequency: 8 issues/year

The Journal of Computer and System Sciences is a distinguished publication founded in 1967 and continually striving to push the boundaries of knowledge in computer science and applied mathematics. Published by Academic Press Inc, Elsevier Science, this journal boasts impressive credentials, holding a Q1 quartile ranking across multiple categories including Applied Mathematics, Computational Theory and Mathematics, Computer Networks and Communications, and Theoretical Computer Science as of 2023. With a focus on innovative research and comprehensive theoretical developments, this journal serves as a pivotal forum for authors and readers alike, facilitating cutting-edge contributions to the field. The journal is not currently open access, providing a curated selection of high-quality articles for its subscription residents. By engaging with this journal, researchers, professionals, and students can gain insight into the latest trends, prominent methodologies, and significant findings that shape the modern landscape of computing and systems analysis.

Theoretical Computer Science

Innovating Knowledge in Mathematical Logic
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.

JOURNAL OF COMBINATORIAL OPTIMIZATION

Bridging theory and application in combinatorial studies.
Publisher: SPRINGERISSN: 1382-6905Frequency: 8 issues/year

JOURNAL OF COMBINATORIAL OPTIMIZATION, published by Springer, stands at the forefront of research in the fields of applied mathematics, computational theory, and combinatorial optimization. With an ISSN of 1382-6905 and E-ISSN of 1573-2886, this esteemed journal serves as a vital platform for groundbreaking studies and methodologies from 1997 to 2024. Notably positioned in the Q3 quartile across several categories, including applied mathematics and discrete mathematics, it reflects a commitment to high-quality research that pushes the boundaries of knowledge in quantitative analysis and algorithm development. Although it does not offer open access, its visibility and impact are underscored by impressive Scopus rankings, such as the 67th percentile in discrete mathematics and combinatorics. The journal aims to foster a comprehensive understanding of combinatorial optimization and its applications, making it an indispensable resource for researchers, professionals, and students eager to stay abreast of the latest trends and advancements in these dynamic disciplines.