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
∙
12/07/2022
Partial gathering of mobile agents in dynamic rings
In this paper, we consider the partial gathering problem of mobile agent...
research
∙
08/17/2022
Gathering Despite Defected View
An autonomous mobile robot system consisting of many mobile computationa...
research
∙
05/25/2021
Smoothed Analysis of Population Protocols
In this work, we initiate the study of smoothed analysis of population p...
research
∙
03/15/2021
Gathering of seven autonomous mobile robots on triangular grids
In this paper, we consider the gathering problem of seven autonomous mob...
research
∙
10/18/2020
Self-stabilizing Graph Exploration by a Single Agent
In this paper, we give two self-stabilizing algorithms that solve graph ...
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
∙
09/08/2020
Self-Stabilizing Construction of a Minimal Weakly 𝒮𝒯-Reachable Directed Acyclic Graph
We propose a self-stabilizing algorithm to construct a minimal weakly 𝒮𝒯...
research
∙
08/21/2020
Efficient Dispersion of Mobile Agents without Global Knowledge
We consider the dispersion problem for mobile agents. Initially, k agent...
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
