2 papers
cs.DC2025
Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
Haruki Kanaya, Ryota Eguchi, Taisho Sasada +1
The population protocol model is a computational model for passive mobile agents. We address the leader election problem, which determines a unique leader on arbitrary communicatio…
cs.DC2025
Time- and Space-Optimal Silent Self-Stabilizing Exact Majority in Population Protocols
Haruki Kanaya, Ryota Eguchi, Taisho Sasada +2
We address the self-stabilizing exact majority problem in the population protocol model, introduced by Angluin, Aspnes, Diamadi, Fischer, and Peralta (2004). In this model, there a…