ACM Transactions on Computation Theory

Aims & Scope

The ACM Transactions on Computation Theory (ToCT) is a scholarly journal publishing outstanding original research that explores the mathematical nature of computation, and its theoretical limitations.

Topics include, but are not limited to, computational complexity, foundations of cryptography, randomness in computing, coding theory, models of computation including parallel, distributed and quantum and other emerging models, computational learning theory, theoretical computer science aspects of areas such as databases, information retrieval, economic models and networks.

View Aims & Scope

---

Metrics & Ranking

Journal Rank

Year	Value
2024	7245

Journal Citation Indicator

Year	Value
2024	52

Impact Factor

Year	Value
2024	0.80

SJR (SCImago Journal Rank)

Year	Value
2024	0.761

Quartile

Year	Value
2024	Q2

---

---

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 Computer Science and 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.

• (Leveled) Fully Homomorphic Encryption without Bootstrapping

  Citation: 977

  Authors: Zvika, Craig, Vinod

• Algebrization

  Citation: 90

  Authors: Scott, Avi

• Compressed matrix multiplication

  Citation: 59

  Authors: Rasmus

• Complexity Hierarchies beyond Elementary

  Citation: 51

  Authors: Sylvain

• On multiway cut parameterized above lower bounds

  Citation: 50

  Authors: Marek, Marcin, Michał, Jakub Onufry

• Exact Quantum Algorithms for the Leader Election Problem

  Citation: 37

  Authors: Seiichiro, Hirotada, Keiji

• Quantum rejection sampling

  Citation: 32

  Authors: Maris, Martin, Jérémie

• Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny)

  Citation: 31

  Authors: Ryan, Yi, Yuan

• Directed Planar Reachability Is in Unambiguous Log-Space

  Citation: 30

  Authors: Chris, Raghunath, N. V.

• Quantum XOR Games

  Citation: 30

  Authors: Oded, Thomas

---