RAIRO - Theoretical Informatics and Applications

Aims & Scope

The journal publishes original research papers of high scientific level in the area of theoretical computer science and its applications.

Theoretical computer science is understood in its broadest sense and comprises in particular the following areas: automata and formal languages, game theory, rewriting systems, design and analysis of algorithms, complexity theory, quantum computation, concurrent, distributed, parallel computations, verification of programs, “logic” and compilers, computational geometry and graphics on computers, cryptography, combinatorics on words.

This list is not supposed to be exhaustive and the editorial board will promote new fields of research that will be worked out in the future.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	0.5

SJR (SCImago Journal Rank)

Year	Value
2024	0.234

Quartile

Year	Value
2024	Q4

h-index

Year	Value
2024	33

Journal Rank

Year	Value
2024	19367

Journal Citation Indicator

Year	Value
2024	18

---

---

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.

• Notes on finite asynchronous automata

  Citation: 171

  Authors: Wieslaw

• Speeding up the computations on an elliptic curve using addition-subtraction chains

  Citation: 143

  Authors: François, Jorge

• A limit theorem for “quicksort”

  Citation: 142

  Authors: Uwe

• Adhesive and quasiadhesive categories

  Citation: 138

  Authors: Stephen, Paweł

• The complexity of the travelling repairman problem

  Citation: 117

  Authors: Foto, Stavros, Christos H., George, Nadia

• The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues

  Citation: 110

  Authors: B.

• A sharpening of the Parikh mapping

  Citation: 84

  Authors: Alexandru, Arto, Kai, Sheng

• Repetitions in the Fibonacci infinite word

  Citation: 78

  Authors: F., G.

• Sur les automates circulaires et la conjecture de ÄŒerný

  Citation: 71

  Authors: L.

• Learning deterministic regular grammars from stochastic samples in polynomial time

  Citation: 70

  Authors: Rafael C., Jose

---