RAIRO - Theoretical Informatics and Applications

Signed Chip Firing Games and symmetric Sandpile Models on the cycles p. 133

Robert Cori, Thi Ha Duong Phan and Thi Thu Huong Tran

Published online: 31 October 2012

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

• PDF (188.6 KB)
• References

On the hardness of game equivalence under local isomorphism p. 147

Joaquim Gabarró, Alina García and Maria Serna

Published online: 05 November 2012

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

• PDF (310.3 KB)
• References

A tight bound for exhaustive key search attacks against Message Authentication Codes p. 171

Vinícius G.P. de SÁ, Davidson R. Boccardo, Luiz Fernando Rust and Raphael C.S. Machado

Published online: 06 November 2012

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

• PDF (157.7 KB)
• References

Cutwidth of iterated caterpillars p. 181

Lan Lin and Yixun Lin

Published online: 11 March 2013

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

• PDF (206.7 KB)
• References

A note on constructing infinite binary words with polynomial subword complexity p. 195

Francine Blanchet-Sadri, Bob Chen and Sinziana Munteanu

Published online: 25 April 2013

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

• PDF (118.3 KB)
• References

Decidability of the HD0L ultimate periodicity problem p. 201

Fabien Durand

Published online: 25 April 2013

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

• PDF (224.1 KB)
• References