a person in the record
Sébastien Bouchard
Researcher
Doctorate at Sorbonne Université in 2019 under Franck Petit. Linked to Wikidata and ORCID.
How to read the markscited by a repository's recordstated by Wikidata or indexed by OpenAlexclaimed on an ORCID list, or inferred
Advisors1
- cited by a thesis record
Franck Petit“On the Deterministic Gathering of Mobile Agents”
2019 · Sorbonne Université · doctoral
The line above and below1 step
The advisors of their advisors, four steps up at most, in the thesis records and on Wikidata, each kind marked; a person in both is listed once.
- 1 step up
cited by a thesis recordFranck Petit
Theses1
- cited by a thesis record
On the Deterministic Gathering of Mobile Agents
2019 · Sorbonne Université · doctoral · École doctorale Informatique, télécommunications et électronique de Paris (1992-....) · in English · the thesis's own page ›also named on this thesis
- cited by a thesis recordSwan Duboisjury member
- cited by a thesis recordShantanu Dasjury member
- cited by a thesis recordYoann Dieudonnéjury member
- cited by a thesis recordPaola Flocchinireferee
- cited by a thesis recordPierre Fraigniaudreferee
- cited by a thesis recordDavid Ilcinkasjury member
- cited by a thesis recordMaria Potop-Butucarujury president
Education and career1
From Wikidata, shown separately from the thesis records. Each place opens its Wikidata item.
- undated
Works1
2019 · held from 1 repository · a work missing?
- cited by HAL/TEL OAI's record
On the Deterministic Gathering of Mobile Agents
2019 · doctoral thesis · HAL/TEL OAI
What their ORCID record lists
The works their own ORCID record lists, as they claim them: shown apart from the record's works, never checked or counted with them.
ORCID is asked for the list when this part is opened.
Papers in OpenAlex22
2015most in 2018: 52023
last at Centre National de la Recherche Scientifique, Université de Bordeaux, Laboratoire Bordelais de Recherche en Informatique, Institut Polytechnique de Bordeaux
writes on Optimization and Search Problems, Diffusion and Search Dynamics, Distributed Control Multi-Agent Systems, Distributed systems and fault tolerance, Complexity and Algorithms in Graphs
- indexed by OpenAlex2016 · Distributed Computing · 3 authorscited 37
- indexed by OpenAlex2022 · Distributed Computing · 3 authorscited 17
- indexed by OpenAlexcited 17
Asynchronous approach in the plane: a deterministic polynomial algorithm
2018 · Distributed Computing · 5 authors - indexed by OpenAlexcited 10
On deterministic rendezvous at a node of agents with arbitrary velocities
2018 · Information Processing Letters · 4 authors - indexed by OpenAlex2020 · Algorithmica · 4 authorscited 7
- indexed by OpenAlex2020 · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · 4 authorscited 5
- indexed by OpenAlex2020 · SIAM Journal on Computing · 3 authorscited 4
- indexed by OpenAlex2018 · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 4 authorscited 3
- indexed by OpenAlexcited 2
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
2023 · ACM Transactions on Algorithms · 4 authors - indexed by OpenAlex2021 · Networks · 3 authorscited 2
all 22, most cited first
- indexed by OpenAlexcited 2
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
2020 · arXiv (Cornell University) · 4 authors - indexed by OpenAlex2015 · Lecture notes in computer science · 3 authorscited 2
- indexed by OpenAlex2015 · arXiv (Cornell University) · 3 authorscited 1
- indexed by OpenAlexcited 0
Visual Secrets : A recognition-based security primitive and its use for boardroom voting
2022 · HAL (Le Centre pour la Communication Scientifique Directe) · 3 authors - indexed by OpenAlex2020 · arXiv (Cornell University) · 4 authorscited 0
- indexed by OpenAlex2019 · HAL (Le Centre pour la Communication Scientifique Directe) · 1 authorcited 0
- indexed by OpenAlex2019 · theses.fr (ABES) · 1 authorcited 0
- indexed by OpenAlex2019 · 1 authorcited 0
- indexed by OpenAlex2019 · HAL (Le Centre pour la Communication Scientifique Directe) · 6 authorscited 0
- indexed by OpenAlexcited 0
Trouver un trésor plus rapidement avec des conseils angulaires
2019 · HAL (Le Centre pour la Communication Scientifique Directe) · 4 authors - indexed by OpenAlex2018 · HAL (Le Centre pour la Communication Scientifique Directe) · 3 authorscited 0
- indexed by OpenAlexcited 0
Approche asynchrone dans le plan : un algorithme déterministe polynomial
2018 · HAL (Le Centre pour la Communication Scientifique Directe) · 5 authors