Laurent Rosaz

According to our database, Laurent Rosaz authored at least 9 papers between 1995 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2018

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, Laurent Rosaz, Johan Thapper, Zsolt Tuza

J. Discrete Algorithms, 2018

2016

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

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2012

Non-deterministic Population Protocols.

Joffroy Beauquier, Janna Burman, Laurent Rosaz, Brigitte Rozoy

Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2007

Self-stabilizing Counting in Mobile Sensor Networks with a Base Station.

Joffroy Beauquier, Julien Clément, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Self-stabilizing counting in mobile sensor networks.

Joffroy Beauquier, Julien Clément, Stéphane Messika, Laurent Rosaz, Brigitte Rozoy

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2003

The word problem for 1LC congruences is NP-hard.

Laurent Rosaz

Theor. Comput. Sci., 2003

2000

Self-stabilizing token circulation on asynchronous uniform unidirectional rings.

Laurent Rosaz

Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1998

Inventories of Unavoidable Languages and the Word-Extension Conjecture.

Laurent Rosaz

Theor. Comput. Sci., 1998

1995

Unavoidable Languages, Cuts and Innocent Sets of Words.

Laurent Rosaz

RAIRO Theor. Informatics Appl., 1995