The ACM Transactions on Algorithms (TALG) publishes original research of the highest quality dealing with algorithms that are inherently discrete and finite, and having mathematical content in a natural way, either in the objective or in the analysis. Most welcome are new algorithms and data structures, new and improved analyses, and complexity results. In addition to original research articles TALG will include special features appearing from time to time such as invited columns and a problems section.
Subject Areas
Announcements
ACM Updates Its Peer Review Policy
ACM is pleased to announce that its Publications Board has approved an updated Peer Review Policy. If you have any questions regarding the update, the associated FAQ addresses topics such as confidentiality, the use of large language models in the peer review process, conflicts of interest, and several other relevant concerns. If there are any issues that are not addressed in the FAQ, please contact ACM’s Director of Publications, Scott Delman.
New ACM Policy on Authorship
ACM has a new Policy on Authorship, covering a range of key topics, including the use of generative AI tools. Please familiarize yourself with the new policy and the associated list of Frequently Asked Questions.
Most Frequent Affiliations
Most Cited Authors
Latest Issue
- research-article
- research-article
