![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Sébastien Bouchard
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
- [b1]Sébastien Bouchard:
On the Deterministic Gathering of Mobile Agents. (À propos du rassemblement déterministe d'agents mobiles). Sorbonne University, Paris, France, 2019
Journal Articles
- 2023
- [j8]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! SIAM J. Comput. 52(2): 358-411 (2023) - [j7]Sébastien Bouchard
, Yoann Dieudonné
, Arnaud Labourel
, Andrzej Pelc
:
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. ACM Trans. Algorithms 19(3): 22:1-22:32 (2023) - 2022
- [j6]Sébastien Bouchard, Yoann Dieudonné
, Anissa Lamani:
Byzantine gathering in polynomial time. Distributed Comput. 35(3): 235-263 (2022) - [j5]Sébastien Bouchard, Arnaud Labourel
, Andrzej Pelc
:
Impact of knowledge on the cost of treasure hunt in trees. Networks 80(1): 51-62 (2022) - 2020
- [j4]Sébastien Bouchard
, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. Algorithmica 82(11): 3250-3281 (2020) - 2019
- [j3]Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné
, Swan Dubois, Franck Petit
:
Asynchronous approach in the plane: a deterministic polynomial algorithm. Distributed Comput. 32(4): 317-337 (2019) - 2018
- [j2]Sébastien Bouchard
, Yoann Dieudonné, Andrzej Pelc, Franck Petit
:
On deterministic rendezvous at a node of agents with arbitrary velocities. Inf. Process. Lett. 133: 39-43 (2018) - 2016
- [j1]Sébastien Bouchard
, Yoann Dieudonné, Bertrand Ducourthial:
Byzantine gathering in networks. Distributed Comput. 29(6): 435-457 (2016)
Conference and Workshop Papers
- 2021
- [c7]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. ICALP 2021: 36:1-36:20 - 2020
- [c6]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! PODC 2020: 253-262 - [c5]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. SPAA 2020: 117-127 - 2018
- [c4]Sébastien Bouchard
, Yoann Dieudonné, Anissa Lamani:
Byzantine Gathering in Polynomial Time. ICALP 2018: 147:1-147:15 - [c3]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit
:
Deterministic Treasure Hunt in the Plane with Angular Hints. ISAAC 2018: 48:1-48:13 - 2017
- [c2]Sébastien Bouchard
, Marjorie Bournat, Yoann Dieudonné, Swan Dubois
, Franck Petit
:
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm. DISC 2017: 8:1-8:16 - 2015
- [c1]Sébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial:
Byzantine Gathering in Networks. SIROCCO 2015: 179-193
Informal and Other Publications
- 2020
- [i8]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Treasure Hunt in the Plane with Angular Hints. CoRR abs/2005.00875 (2020) - [i7]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Almost Universal Anonymous Rendezvous in the Plane. CoRR abs/2005.00880 (2020) - [i6]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. CoRR abs/2010.14916 (2020) - 2019
- [i5]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc:
Want to Gather? No Need to Chatter! CoRR abs/1908.11402 (2019) - 2018
- [i4]Sébastien Bouchard, Yoann Dieudonné, Anissa Lamani:
Byzantine Gathering in Polynomial Time. CoRR abs/1801.07656 (2018) - 2017
- [i3]Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc, Franck Petit:
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities. CoRR abs/1710.08291 (2017) - 2016
- [i2]Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois
, Franck Petit:
Asynchronous approach in the plane: A deterministic polynomial algorithm. CoRR abs/1612.02168 (2016) - 2015
- [i1]Sébastien Bouchard, Yoann Dieudonné, Bertrand Ducourthial:
Byzantine Gathering in Networks. CoRR abs/1504.01623 (2015)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint