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

Free Access

Editorial

Foreword to the special issue dedicated to the sixteenth “Journées Montoises d’Informatique Théorique”

Émilie Charlier, Julien Leroy and Michel Rigo

RAIRO-Theor. Inf. Appl., 51 4 (2017) 167

Published online: 13 February 2018

DOI: https://doi.org/10.1051/ita/2018001
- PDF (130.9 KB)
On avoidability of formulas with reversal

James D. Currie, Lucas Mol and Narad Rampersad

RAIRO-Theor. Inf. Appl., 51 4 (2017) 181-189

Published online: 13 February 2018

DOI: https://doi.org/10.1051/ita/2017013
- PDF (331.2 KB)
- References
A uniform cube-free morphism is k-power-free for all integers k ≥ 4

Francis Wlazinski

RAIRO-Theor. Inf. Appl., 51 4 (2017) 205-216

Published online: 13 February 2018

DOI: https://doi.org/10.1051/ita/2017015
- PDF (465.4 KB)
- References
Translation of a Digital Line into another according to various Digitization Processes

Jean-Pierre Borel

RAIRO-Theor. Inf. Appl., 51 4 (2017) 169-180

Published online: 31 January 2018

DOI: https://doi.org/10.1051/ita/2017016
- PDF (1.692 MB)
- References
Cellular automata and powers of p∕q

Jarkko Kari and Johan Kopra

RAIRO-Theor. Inf. Appl., 51 4 (2017) 191-204

Published online: 31 January 2018

DOI: https://doi.org/10.1051/ita/2017014
- PDF (574.9 KB)
- References
Bipartite binomial heaps

Amr Elmasry, Claus Jensen and Jyrki Katajainen

RAIRO-Theor. Inf. Appl., 51 3 (2017) 121-133

Published online: 12 December 2017

DOI: https://doi.org/10.1051/ita/2017010
- PDF (278.8 KB)
- References

Most read articles

9	Free Access Analysis of quickselect : an algorithm for order statistics Hosam M. Mahmoud, Reza Modarres and Robert T. Smythe RAIRO-Theor. Inf. Appl., 29 4 (1995) 255-276 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1995290402551 PDF (1.36 MB) References
3	Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming Maria Serna and Fatos Xhafa RAIRO-Theor. Inf. Appl., 42 2 (2008) 237-252 Published online: 25 September 2007 DOI: https://doi.org/10.1051/ita:2007032 PDF (241.8 KB) References
3	Free Access Open shop scheduling with delays V. J. Rayward-Smith and D. Rebaine RAIRO-Theor. Inf. Appl., 26 5 (1992) 439-447 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1992260504391 PDF (693 KB) References
3	Free Access Learning deterministic regular grammars from stochastic samples in polynomial time Rafael C. Carrasco and Jose Oncina RAIRO-Theor. Inf. Appl., 33 1 (1999) 1-19 Published online: 15 August 2002 DOI: https://doi.org/10.1051/ita:1999102 PDF (395.2 KB) References
2	Free Access Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire Jean-Luc Rémy RAIRO. Inform. théor., 19 2 (1985) 179-195 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1985190201791 PDF (1.00 MB) References

RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

Foreword to the special issue dedicated to the sixteenth “Journées Montoises d’Informatique Théorique”

On avoidability of formulas with reversal

A uniform cube-free morphism is k-power-free for all integers k ≥ 4

Translation of a Digital Line into another according to various Digitization Processes

Cellular automata and powers of p∕q

Bipartite binomial heaps

Analysis of quickselect : an algorithm for order statistics

Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming

Open shop scheduling with delays

Learning deterministic regular grammars from stochastic samples in polynomial time

Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire

Analysis of quickselect : an algorithm for order statistics

Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire

Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères

Foreword to the special issue dedicated to the sixteenth “Journées Montoises d’Informatique Théorique”

The complexity of the travelling repairman problem

A property of biprefix codes

Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire

The complexity of the travelling repairman problem

Analysis of quickselect : an algorithm for order statistics

Modèles non déterministes de types abstraits

News

25	Free Access Analysis of quickselect : an algorithm for order statistics Hosam M. Mahmoud, Reza Modarres and Robert T. Smythe RAIRO-Theor. Inf. Appl., 29 4 (1995) 255-276 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1995290402551 PDF (1.36 MB) References
16	Free Access Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire Jean-Luc Rémy RAIRO. Inform. théor., 19 2 (1985) 179-195 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1985190201791 PDF (1.00 MB) References
10	Free Access Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères M. Bousquet-Mélou RAIRO-Theor. Inf. Appl., 26 3 (1992) 205-219 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1992260302051 PDF (1.14 MB) References
8	Free Access Editorial Foreword to the special issue dedicated to the sixteenth “Journées Montoises d’Informatique Théorique” Émilie Charlier, Julien Leroy and Michel Rigo RAIRO-Theor. Inf. Appl., 51 4 (2017) 167 Published online: 13 February 2018 DOI: https://doi.org/10.1051/ita/2018001 PDF (130.9 KB)
7	Free Access The complexity of the travelling repairman problem Foto Afrati, Stavros Cosmadakis, Christos H. Papadimitriou, George Papageorgiou and Nadia Papakostantinou RAIRO-Theor. Inf. Appl., 20 1 (1986) 79-87 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1986200100791 PDF (670 KB) References

50	Free Access A property of biprefix codes Martine Leonard RAIRO-Theor. Inf. Appl., 22 3 (1988) 311-318 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1988220303111 PDF (544 KB) References
36	Free Access Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire Jean-Luc Rémy RAIRO. Inform. théor., 19 2 (1985) 179-195 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1985190201791 PDF (1.00 MB) References
35	Free Access The complexity of the travelling repairman problem Foto Afrati, Stavros Cosmadakis, Christos H. Papadimitriou, George Papageorgiou and Nadia Papakostantinou RAIRO-Theor. Inf. Appl., 20 1 (1986) 79-87 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1986200100791 PDF (670 KB) References
31	Free Access Analysis of quickselect : an algorithm for order statistics Hosam M. Mahmoud, Reza Modarres and Robert T. Smythe RAIRO-Theor. Inf. Appl., 29 4 (1995) 255-276 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1995290402551 PDF (1.36 MB) References
30	Free Access Modèles non déterministes de types abstraits Pierre Lescanne RAIRO. Inform. théor., 16 3 (1982) 225-244 Published online: 01 February 2017 DOI: https://doi.org/10.1051/ita/1982160302251 PDF (1.45 MB) References