research
∙
09/05/2023
Run for Cover: Dominating Set via Mobile Agents
Research involving computing with mobile agents is a fast-growing field,...
share
research
∙
07/12/2023
Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement
This paper studies the message complexity of authenticated Byzantine agr...
research
∙
05/02/2023
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots
Over the years, much research involving mobile computational entities ha...
research
∙
02/22/2023
Improved Deterministic Leader Election in Diameter-Two Networks
In this paper, we investigate the leader election problem in diameter-tw...
research
∙
11/22/2022
Fault-Tolerant Dispersion of Mobile Robots
We consider the mobile robot dispersion problem in the presence of fault...
research
∙
08/22/2022
Fault-Tolerant Graph Realizations in the Congested Clique
In this paper, we study the graph realization problem in the Congested C...
research
∙
02/15/2021
Byzantine Dispersion on Graphs
This paper considers the problem of Byzantine dispersion and extends pre...
research
∙
05/15/2020
Efficient Distributed Algorithms for the K-Nearest Neighbors Problem
The K-nearest neighbors is a basic problem in machine learning with nume...
research
∙
04/23/2020
Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots
The problem of dispersion of mobile robots on a graph asks that n robots...
research
∙
01/13/2020
Live Exploration with Mobile Robots in a Dynamic Ring, Revisited
The graph exploration problem requires a group of mobile robots, initial...
research
∙
09/04/2019
Dispersion of Mobile Robots in the Global Communication Model
The dispersion problem on graphs asks k≤ n robots placed initially arbit...
research
∙
04/16/2019
Efficient Distributed Community Detection in the Stochastic Block Model
Designing effective algorithms for community detection is an important a...
research
∙
02/27/2019
Dispersion of Mobile Robots: The Power of Randomness
We consider cooperation among insects, modeled as cooperation between mo...
research
∙
12/13/2018
Improved Dispersion of Mobile Robots on Arbitrary Graphs
The dispersion problem on graphs asks k≤ n robots placed initially arbit...
research
∙
06/26/2018
The Communication Cost of Information Spreading in Dynamic Networks
This paper investigates the message complexity of distributed informatio...
research
∙
01/05/2018