Journal of the ACM

Aims & Scope

The best indicator of the scope of the journal is provided by the areas covered by its Editorial Board.

These areas change from time to time, as the field evolves.

The following areas are currently covered by a member of the Editorial Board: Algorithms and Combinatorial Optimization; Algorithms and Data Structures; Algorithms, Combinatorial Optimization, and Games; Artificial Intelligence; Complexity Theory; Computational Biology; Computational Geometry; Computer Graphics and Computer Vision; Computer-Aided Verification; Cryptography and Security; Cyber-Physical, Embedded, and Real-Time Systems; Database Systems and Theory; Distributed Computing; Economics and Computation; Information Theory; Logic and Computation; Logic, Algorithms, and Complexity; Machine Learning and Computational Learning Theory; Networking; Parallel Computing and Architecture; Programming Languages; Quantum Computing; Randomized Algorithms and Probabilistic Analysis of Algorithms; Scientific Computing and High Performance Computing; Software Engineering; Web Algorithms and Data Mining

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	2.5
2024	2.30

SJR (SCImago Journal Rank)

Year	Value
2024	2.246

Quartile

Year	Value
2024	Q1

h-index

Year	Value
2024	146

Journal Rank

Year	Value
2024	1158

Journal Citation Indicator

Year	Value
2024	557

---

---

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 Engineering, 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.

• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

  Citation: 6574

  Authors: C. L., James W.

• Authoritative sources in a hyperlinked environment

  Citation: 5552

  Authors: Jon M.

• Robust principal component analysis?

  Citation: 4652

  Authors: Emmanuel J., Xiaodong, Yi, John

• `` Direct Search'' Solution of Numerical and Statistical Problems

  Citation: 3166

  Authors: Robert, T. A.

• Impossibility of distributed consensus with one faulty process

  Citation: 2925

  Authors: Michael J., Nancy A., Michael S.

• A Machine-Oriented Logic Based on the Resolution Principle

  Citation: 2432

  Authors: J. A.

• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

  Citation: 2294

  Authors: Michel X., David P.

• A threshold of ln <i>n</i> for approximating set cover

  Citation: 2016

  Authors: Uriel

• The String-to-String Correction Problem

  Citation: 2008

  Authors: Robert A., Michael J.

• Fibonacci heaps and their uses in improved network optimization algorithms

  Citation: 1752

  Authors: Michael L., Robert Endre

---