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...
share
research
∙
10/03/2022
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
A singularly (near) optimal distributed algorithm is one that is (near) ...
research
∙
04/18/2022
Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
We study the distributed minimum spanning tree (MST) problem, a fundamen...
research
∙
04/18/2022
Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity
Maximal Independent Set (MIS) is one of the central and most well-studie...
research
∙
08/04/2021
Singularly Near Optimal Leader Election in Asynchronous Networks
This paper concerns designing distributed algorithms that are singularly...
research
∙
06/02/2021
Efficient Deterministic Leader Election for Programmable Matter
It was suggested that a programmable matter system (composed of multiple...
research
∙
02/15/2021
Byzantine Dispersion on Graphs
This paper considers the problem of Byzantine dispersion and extends pre...
research
∙
08/06/2020
Singularly Optimal Randomized Leader Election
This paper concerns designing distributed algorithms that are singularly...
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
∙
05/02/2019
Deterministic Leader Election in Programmable Matter
Addressing a fundamental problem in programmable matter, we present the ...
research
∙
02/27/2019
