( en | de | ru )

 

Disambiguation of "Bouchard, Sébastien"

Author of the publication

copydeleteadd this publication to your clipboard
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs.

, , , and . ACM Trans. Algorithms, 19 (3): 22:1-22:32 (July 2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sébastien Beyou

Sébastien Tixeuil

Sébastien Lallé

Sébastien Carcanague

Sébastien Choplin

 

Other publications of authors with the same name

Almost Universal Anonymous Rendezvous in the Plane., , , and . SPAA, page 117-127. ACM, (2020)Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs., , , and . ACM Trans. Algorithms, 19 (3): 22:1-22:32 (July 2023)Byzantine Gathering in Polynomial Time., , and . ICALP, volume 107 of LIPIcs, page 147:1-147:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the Deterministic Gathering of Mobile Agents. (À propos du rassemblement déterministe d'agents mobiles).. Sorbonne University, Paris, France, (2019)Want to Gather? No Need to Chatter!, , and . PODC, page 253-262. ACM, (2020)Asynchronous approach in the plane: a deterministic polynomial algorithm., , , , and . Distributed Comput., 32 (4): 317-337 (2019)Byzantine Gathering in Networks., , and . SIROCCO, volume 9439 of Lecture Notes in Computer Science, page 179-193. Springer, (2015)Deterministic Treasure Hunt in the Plane with Angular Hints., , , and . ISAAC, volume 123 of LIPIcs, page 48:1-48:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs., , , and . ICALP, volume 198 of LIPIcs, page 36:1-36:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)