Open Access
Complexity issues of perfect secure domination in graphs
RAIRO-Theor. Inf. Appl., 55 (2021) 11
Published online: 28 October 2021
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)
RAIRO: ITA is a section of RAIRO, Revue d'Automatique, d'Informatique et de Recherche Opérationnelle. RAIRO is an international journal devoted to high-level pure and applied research on the use of scientific methods and information processing in business and industry. Read more
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) is being published under Subscribe-to-Open. All articles are published in open access free of charge under a CC-BY 4.0 license.
More information and FAQs are available here. To discuss or join the programme, please contact us.
More information and FAQs are available here. To discuss or join the programme, please contact us.
-
-
Open AccessEditorial
Publisher’s Note
RAIRO-Theor. Inf. Appl., 55 (2021) E2Published online: 17 September 2021 -
Open Access
A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes
RAIRO-Theor. Inf. Appl., 55 (2021) 10Published online: 17 September 2021 -
Open AccessEditorial
Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)
RAIRO-Theor. Inf. Appl., 55 (2021) E1Published online: 22 July 2021 -
Open Access
Bottom-Up derivatives of tree expressions
RAIRO-Theor. Inf. Appl., 55 (2021) 4Published online: 22 July 2021 -
Open Access
On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers
RAIRO-Theor. Inf. Appl., 55 (2021) 5Published online: 22 July 2021
| 11 |
Free Access
Upper bound for palindromic and factor complexity of rich wordsRAIRO-Theor. Inf. Appl., 55 (2021) 1
Published online: 20 January 2021
|
| 11 |
Free Access
A limit theorem for “quicksort”RAIRO-Theor. Inf. Appl., 25 1 (1991) 85-100
Published online: 01 February 2017
|
| 8 |
Free Access
Pour en finir avec la dérécursivation du problème des tours de HanoïRAIRO-Theor. Inf. Appl., 24 1 (1990) 17-35
Published online: 01 February 2017
|
| 6 |
Free Access
On the difficulty of finding walks of length kRAIRO-Theor. Inf. Appl., 31 5 (1997) 429-435
Published online: 01 February 2017
|
| 5 |
Free Access
The simplest binary word with only three squaresRAIRO-Theor. Inf. Appl., 55 (2021) 3
Published online: 20 April 2021
|
