Papers
7
Total Citations
65
H-Index
5
About
Thibaut Balabonski is a leading researcher in distributed computing, with a focus on the formal verification of algorithms for swarms of mobile robots. His work addresses fundamental coordination problems such as gathering and exploration, where robots must collectively visit all reachable locations or converge to a single point. Balabonski’s major contribution lies in developing certified algorithms—provably correct solutions verified through formal methods—for these tasks under challenging models like synchronous and asynchronous moves, often without multiplicity detection. His most cited paper, “Synchronous Gathering without Multiplicity Detection: A Certified Algorithm” (2018, 21 citations), demonstrates this approach, while his foundational framework for certified impossibility results (2018, 12 citations) provides rigorous tools for proving what cannot be achieved. By bridging theoretical distributed computing with formal verification, Balabonski’s work ensures reliability in robot coordination, with cumulative citations exceeding 65. His surveys and brief announcements further highlight open problems, making his research essential for students and researchers exploring certified solutions in multi-robot systems.
Research Focus
Key Achievements
Top Papers
- 1Synchronous Gathering without Multiplicity Detection: a Certified Algorithm21 citations · 2018
- 2
- 3
- 4Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm11 citations · 2016
- 5
- 6
- 7