ISSN: 0988-3754

Journal Home

Journal Guideline

RAIRO - Theoretical Informatics and Applications Q4 Unclaimed

EDP Sciences France

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

RAIRO - Theoretical Informatics and Applications is a journal indexed in SJR in Software and Mathematics (miscellaneous) with an H index of 31. It has an SJR impact factor of 0,11 and it has a best quartile of Q4. It is published in English. It has an SJR impact factor of 0,11.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy:

Type of publications:

Publication frecuency: -

Categories: Computer Science Applications (Q4) Mathematics (miscellaneous) (Q4) Software (Q4)

Price

- €

Inmediate OA

NPD

Embargoed OA

- €

Non OA

Metrics

RAIRO - Theoretical Informatics and Applications

0,11

SJR Impact factor

31

H Index

12

Total Docs (Last Year)

29

Total Docs (3 years)

247

Total Refs

9

Total Cites (3 years)

27

Citable Docs (3 years)

0.18

Cites/Doc (2 years)

20.58

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

International Journal of Digital Crime and Forensics Q4
Revue d'Intelligence Artificielle Q4
International Journal of Embedded Systems Q4
Image Processing On Line Q4
Neural Network World Q4

Compare this journals

Aims and Scope

Best articles by citations

On graph products of automatic monoids

On context-free rewriting with a simple restriction and its computational completeness

Finite presentability of strongly finite dilators

Asynchronous sliding block maps

The Helping Hierarchy

A Generalisation of Entity and Referential Integrity in Relational Databases

Trace languages defined by regular string languages

Tree algebra of sofic tree languages

Linear automata with translucent letters and linear context-free trace languages

Finite repetition threshold for large alphabets

Advice complexity of disjoint path allocation

Eye localization for face recognition

SHOW MORE ARTICLES

An upper bound on the complexity of recognizable tree languages

On the number of iterations required by Von Neumann addition

New applications of the wreath product of forest algebras

Quantum finite automata with control language

Automata-based Representations for Infinite Graphs

A remark on morphic sturmian words

Labeled shortest paths in digraphs with negative and positive edge weights

Solving maximum independent set by asynchronous distributed hopfield-type neural networks

The number of binary rotation words

An Exercise on Fibonacci Representations

Iteration of rational transductions

On Christoffel classes