Sébastien Bouchard

According to our database, Sébastien Bouchard authored at least 11 papers between 2016 and 2023.

Collaborative distances:

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

2023

Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs.

Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

ACM Trans. Algorithms, July, 2023

Want to Gather? No Need to Chatter!

Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc

SIAM J. Comput., April, 2023

2022

Impact of knowledge on the cost of treasure hunt in trees.

Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc

Networks, 2022

Byzantine gathering in polynomial time.

Sébastien Bouchard, Yoann Dieudonné, Anissa Lamani

Distributed Comput., 2022

2021

Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs.

Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Deterministic Treasure Hunt in the Plane with Angular Hints.

Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit

Algorithmica, 2020

Almost Universal Anonymous Rendezvous in the Plane.

Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

On the Deterministic Gathering of Mobile Agents. (À propos du rassemblement déterministe d'agents mobiles).

Sébastien Bouchard

PhD thesis, 2019

Asynchronous approach in the plane: a deterministic polynomial algorithm.

Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, Franck Petit

Distributed Comput., 2019

2018

On deterministic rendezvous at a node of agents with arbitrary velocities.

Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit

Inf. Process. Lett., 2018

2016

Byzantine gathering in networks.

Sébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial

Distributed Comput., 2016