Showing cs.DCShow all
3 papers · 1 filter
cs.DC2026
Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
Yuichi Sudo
We study the self-stabilizing leader election (SS-LE) problem in the population protocol model, assuming exact knowledge of the population size . Burman, Chen, Chen, Doty, Nowak…
cs.DC2026
Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
Yuichi Sudo, Naoki Kitamura, Masahiro Shibata +4
We study deterministic exploration by a single agent in -interval-connected graphs, a standard model of dynamic networks in which, for every time window of length , the inter…
cs.DC2025
Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols
Takumi Araya, Yuichi Sudo
This paper addresses the collision detection problem in population protocols. The network consists of state machines called agents. At each time step, exactly one pair of agents is…