research
∙
05/15/2023
A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States
We propose a self-stabilizing leader election (SS-LE) protocol on ring n...
share
research
∙
11/01/2022
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs
We investigated the computational power of a single mobile agent in an n...
research
∙
09/05/2022
Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices
We investigate the computational power of the deterministic single-agent...
research
∙
08/24/2022
Deterministic Fault-Tolerant Connectivity Labeling Scheme with Adaptive Query Processing Time
The f-fault-toleratant connectivity labeling (f-FTC labeling) is a schem...
research
∙
08/17/2022
Gathering Despite Defected View
An autonomous mobile robot system consisting of many mobile computationa...
research
∙
03/29/2021
A cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluations
A distributed system consisting of a huge number of computational entiti...
research
∙
09/23/2020
Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols
We propose a self-stabilizing leader election protocol on directed rings...
research
∙
08/21/2020
Efficient Dispersion of Mobile Agents without Global Knowledge
We consider the dispersion problem for mobile agents. Initially, k agent...
research
∙
08/10/2020
Communication Efficient Self-Stabilizing Leader Election (Full Version)
This paper presents a randomized self-stabilizing algorithm that elects ...
research
∙
05/20/2020
Time-optimal Loosely-stabilizing Leader Election in Population Protocols
We consider the leader election problem in population protocol models. I...
research
∙
03/17/2020
The Power of Global Knowledge on Self-stabilizing Population Protocols
In the population protocol model, many problems cannot be solved in a se...
research
∙
07/25/2019
A Self-Stabilizing Minimal k-Grouping Algorithm
We consider the minimal k-grouping problem: given a graph G=(V,E) and a ...
research
∙
06/25/2019
Leader Election Requires Logarithmic Time in Population Protocols
In this paper, it is shown that any leader election problem requires log...
research
∙
05/24/2019
Atomic Cross-Chain Swaps with Improved Space and Time Complexity
An effective atomic cross-chain swap protocol is introduced by Herlihy [...
research
∙
12/29/2018