ACM Transactions on Algorithms

Aims & Scope

ACM Transactions on Algorithms welcomes submissions of 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.

Specific areas of computation covered by the journal include combinatorial searches and objects; counting; discrete optimization and approximation; randomization and quantum computation; parallel and distributed computation; algorithms for graphs, geometry, arithmetic, number theory, strings; on-line analysis; cryptography; coding; data compression; learning algorithms; methods of algorithmic analysis; discrete algorithms for application areas such as biology, economics, game theory, communication, computer systems and architecture, hardware design, scientific computing

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	1.4
2024	0.90

Journal Rank

Year	Value
2024	2034

Journal Citation Indicator

Year	Value
2024	284

SJR (SCImago Journal Rank)

Year	Value
2024	1.650

Quartile

Year	Value
2024	Q1

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Multiplierless multiple constant multiplication

  Citation: 322

  Authors: Yevgen, Markus

• Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets

  Citation: 300

  Authors: Rajeev, Venkatesh, Srinivasa Rao

• Compressed representations of sequences and full-text indexes

  Citation: 262

  Authors: Paolo, Giovanni, Veli, Gonzalo

• Skip graphs

  Citation: 258

  Authors: James, Gauri

• Algorithmic construction of sets for <i>k</i> -restrictions

  Citation: 200

  Authors: Noga, Dana, Shmuel

• Fast sparse matrix multiplication

  Citation: 165

  Authors: Raphael, Uri

• Finding the <i>k</i> shortest simple paths

  Citation: 151

  Authors: John, Matthew, Subhash

• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

  Citation: 150

  Authors: Kenneth L.

• Algorithms for power savings

  Citation: 140

  Authors: Sandy, Sandeep, Rajesh

• Energy-efficient algorithms for flow time minimization

  Citation: 139

  Authors: Susanne, Hiroshi

---