1 citations · 3 across the 11 of their papers we have counts for
18 papers
The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms
Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata +1
Self-stabilization is a versatile methodology in the design of fault-tolerant distributed algorithms for transient faults. A self-stabilizing system automatically recovers from any…
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…
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots
Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei +4
We consider a strong variant of the crash fault-tolerant gathering problem called stand-up indulgent gathering (SUIG), by robots endowed with limited visibility sensors and lights…
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…
A Nearly Time-Optimal Population Protocol for Self-Stabilizing Leader Election on Rings with Polylogarithmic States
Daisuke Yokota, Yuichi Sudo, Fukuhito Ooshita +1
We propose a self-stabilizing leader election (SS-LE) protocol on ring networks in the population protocol model. Given an integer satisfying , whe…
Gathering despite a linear number of weakly Byzantine agents
Jion Hirose, Junya Nakamura, Fukuhito Ooshita +1
We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist agents with unique identifiers (IDs) in th…