Sébastien Bouchard

Orcid: 0000-0002-6464-9517

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs.
ACM Trans. Algorithms, July, 2023

2022
Impact of knowledge on the cost of treasure hunt in trees.
Networks, 2022

2021
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020
Almost Universal Anonymous Rendezvous in the Plane.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Want to Gather? No Need to Chatter!
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

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

2018
On deterministic rendezvous at a node of agents with arbitrary velocities.
Inf. Process. Lett., 2018

Deterministic Treasure Hunt in the Plane with Angular Hints.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Byzantine Gathering in Polynomial Time.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

2015
Byzantine Gathering in Networks.
Proceedings of the Structural Information and Communication Complexity, 2015


  Loading...