Subscriber Authentication Point

Volume 21 / No 1 (1987)

Free Access to the whole issue

Export the citation of the selected articles Export
Select all

RAIRO - Theoretical Informatics and Applications

Volume 21 / No 1 (1987)

Free Access

Algorithmes pour vérifier la conjecture de Syracuse p. 3

Jacques Arsac

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1987210100031

Free Access

Worst case analysis of two heuristics for the set partitioning problem p. 11

A. Marchetti Spaccamela and A. Pelaggi

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1987210100111

Free Access

Sur la complexité d'un problème de codage p. 25

Antoine Lobstein and Gérard Cohen

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1987210100251

Free Access

Sur les ensembles linéaires p. 33

Michel Latteux

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1987210100331

Free Access

Langages algébriques déterministes non générateurs p. 41

L. Boasson and A. Petit

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1987210100411

Free Access

Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes p. 59

Patrice Naudin

Published online: 01 February 2017

DOI: https://doi.org/10.1051/ita/1987210100591