16 citations · 68 across the 45 of their papers we have counts for
3 papers · 1 filter
Reliable Broadcast despite Mobile Byzantine Faults
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
We investigate the solvability of the Byzantine Reliable Broadcast and Byzantine Broadcast Channel problems in distributed systems affected by Mobile Byzantine Faults. We show that…
Meeting Times of Non-atomic Random Walks
Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue +1
In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undir…
Stand-Up Indulgent Gathering on Lines
Quentin Bramas, Sayaka Kamei, Anissa Lamani +1
We consider a variant of the crash-fault gathering problem called stand-up indulgent gathering (SUIG). In this problem, a group of mobile robots must eventually gather at a single…