5 citations · 5 across the 7 of their papers we have counts for
7 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…
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…
Efficient Dispersion of Mobile Agents without Global Knowledge
Takahiro Shintaku, Yuichi Sudo, Hirotsugu Kakugawa +1
We consider the dispersion problem for mobile agents. Initially, k agents are located at arbitrary nodes in an undirected graph. Agents can migrate from node to node via an edge in…
Atomic Cross-Chain Swaps with Improved Space and Local Time Complexity
Soichiro Imoto, Yuichi Sudo, Hirotsugu Kakugawa +1
An effective atomic cross-chain swap protocol is introduced by Herlihy [Herlihy, 2018] as a distributed coordination protocol in order to exchange assets across multiple blockchain…
Logarithmic Expected-Time Leader Election in Population Protocol Model
Yuichi Sudo, Fukuhito Ooshita, Taisuke Izumi +2
In this paper, the leader election problem in the population protocol model is considered. A leader election protocol with logarithmic stabilization time is given. Given a rough kn…
An asynchronous message-passing distributed algorithm for the global critical section problem
Sayaka Kamei, Hirotsugu Kakugawa
This paper considers the global -CS problem which is the problem of controlling the system in such a way that, at least and at most processes must be in the CS at a…
Partial Gathering of Mobile Agents in Asynchronous Rings
Masahiro Shibata, Shinji Kawai, Fukuhito Ooshita +2
In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings equipped with whiteboards on nodes. The partial gathering problem is…