Over the years, much research involving mobile computational entities ha...
A singularly (near) optimal distributed algorithm is one that is (near)
...
We study the distributed minimum spanning tree (MST) problem, a fundamen...
Maximal Independent Set (MIS) is one of the central and most well-studie...
This paper concerns designing distributed algorithms that are singularly...
It was suggested that a programmable matter system (composed of multiple...
This paper considers the problem of Byzantine dispersion and extends pre...
This paper concerns designing distributed algorithms that are singularly...
The problem of dispersion of mobile robots on a graph asks that n robots...
The graph exploration problem requires a group of mobile robots, initial...
Addressing a fundamental problem in programmable matter, we present the ...
We consider cooperation among insects, modeled as cooperation between mo...