Unavoidable Languages, Cuts and Innocent Sets of Words. - Laurent Rosaz (RAIRO Theor. Informatics Appl., 1995)

Inventories of Unavoidable Languages and the Word-Extension Conjecture. - Laurent Rosaz (Theor. Comput. Sci., 1998)

Self-stabilizing token circulation on asynchronous uniform unidirectional rings. - Laurent Rosaz (PODC, 2000)

The word problem for 1LC congruences is NP-hard. - Laurent Rosaz (Theor. Comput. Sci., 2003)

Self-stabilizing counting in mobile sensor networks. - Joffroy Beauquier; Julien Clément 002; Stéphane Messika; Laurent Rosaz; Brigitte Rozoy (PODC, 2007)

Self-stabilizing Counting in Mobile Sensor Networks with a Base Station. - Joffroy Beauquier; Julien Clément 002; Stéphane Messika; Laurent Rosaz; Brigitte Rozoy (DISC, 2007)

Non-deterministic Population Protocols. - Joffroy Beauquier; Janna Burman; Laurent Rosaz; Brigitte Rozoy (OPODIS, 2012)

Tropical Dominating Sets in Vertex-Coloured Graphs. - Jean-Alexandre Anglès d'Auriac; Csilla Bujtás; Hakim El Maftouhi; Marek Karpinski; Yannis Manoussakis; Leandro Montero; Narayanan Narayanan; Laurent Rosaz; Johan Thapper; Zsolt Tuza (WALCOM, 2016)

Tropical dominating sets in vertex-coloured graphs. - Jean-Alexandre Anglès d'Auriac; Csilla Bujtás; Abdelhakim El Maftouhi; Marek Karpinski; Yannis Manoussakis; Leandro Montero; N. Narayanan 001; Laurent Rosaz; Johan Thapper; Zsolt Tuza (J. Discrete Algorithms, 2018)