Information and Computation

Aims & Scope

Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory.

Survey articles of exceptional quality will also be considered.

Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	1
2024	0.80

SJR (SCImago Journal Rank)

Year	Value
2024	0.493

Quartile

Year	Value
2024	Q2

h-index

Year	Value
2024	85

Journal Rank

Year	Value
2024	11732

Journal Citation Indicator

Year	Value
2024	335

---

---

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.

• A calculus of mobile processes, I

  Citation: 1953

  Authors: Robin, Joachim, David

• Learning regular sets from queries and counterexamples

  Citation: 1412

  Authors: Dana

• Boosting a Weak Learning Algorithm by Majority

  Citation: 1161

  Authors: Y.

• Symbolic model checking: 1020 States and beyond

  Citation: 1135

  Authors: J.R., E.M., K.L., D.L., L.J.

• Notions of computation and monads

  Citation: 1088

  Authors: Eugenio

• The Weighted Majority Algorithm

  Citation: 1023

  Authors: N., M.K.

• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

  Citation: 914

  Authors: Bruno

• Bisimulation through probabilistic testing

  Citation: 739

  Authors: Kim G., Arne

• A Syntactic Approach to Type Soundness

  Citation: 692

  Authors: A.K., M.

• The calculus of constructions

  Citation: 600

  Authors: Thierry, Gérard

---