34 citations · 48 across the 13 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Byzantine Gathering in Polynomial Time
Sébastien Bouchard, Yoann Dieudonné, Anissa Lamani
We study the task of Byzantine gathering in a network modeled as a graph. Despite the presence of Byzantine agents, all the other (good) agents, starting from possibly different no…
cs.DS2009★ 34 cited
Optimal deterministic ring exploration with oblivious asynchronous robots
Anissa Lamani, Maria Potop-Butucaru, Sébastien Tixeuil
We consider the problem of exploring an anonymous unoriented ring of size by identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the…