Write in a clean editor, then format for ACM Transactions on Algorithms in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
ACM Transactions on Algorithms is a peer-reviewed journal published by ACM, covering Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Optimization and Search Problems. Over its lifetime it has published 1,040 papers, which have received 24,457 citations.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM Transactions on Algorithms 12, 3, Article 45 (2023).
Formats any DOI in ACM Transactions on Algorithms style. No sign-up. |
| Publishes research in | Complexity and Algorithms in Graphs Advanced Graph Theory Research Optimization and Search Problems Computational Geometry and Mesh Generation Algorithms and Data Compression |
| ISSN | 1549-6325 |
| Citation impact (2-yr) | 1.12 |
| h-index | 75 |
| i10-index | 506 |
| Top institutions publishing here | Tel Aviv University |
| Journal website | talg.acm.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
A variable can be multiplied by a given set of fixed-point constants using a multiplier block that consists exclusively of additions, subtractions, and shifts. The generation of a multiplier block from the set of constants is known as the multiple constant multiplication (MCM) problem. Finding the optimal solution, namely, the one with the fewest number…
Given a sequence S = s 1 s 2 … s n of integers smaller than r = O (polylog( n )), we show how S can be represented using nH 0 ( S ) + o ( n ) bits, so that we can know any s q , as well as answer rank…
We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,…, m − 1} for some integer m while supporting the operations of rank( x ), which returns the number of elements in S that are less than x if x ∈ S , and −1 otherwise; and select( i ),…
The problem of maximizing a concave function f(x) in the unit simplex Δ can be solved approximately by a simple greedy algorithm. For given k , the algorithm can find a point x ( k ) on a k -dimensional face of Δ, such that f ( x ( k ) ≥ f(x * )…
Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peer-to-peer systems, and by providing the ability to perform queries…
Journal of the ACM
Proceedings of the ACM on Management of Data
ACM AI Letters
ACM Journal on Computing and Sustainable Societies
ACM Transactions on AI Security and Privacy
ACM Transactions on Computation Theory
ICML - International Conference on Machine Learning
NAACL - North American Chapter of the ACL
