28 citations · 36 across the 3 of their papers we have counts for
12 papers · 1 filter
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
Fabien Dufoulon, Shay Kutten, William K. Moses +2
A singularly (near) optimal distributed algorithm is one that is (near) optimal in \emph{two} criteria, namely, its time and message complexities. For \emph{synchronous} CONGEST ne…
Singularly Near Optimal Leader Election in Asynchronous Networks
Shay Kutten, William K. Moses, Gopal Pandurangan +1
This paper concerns designing distributed algorithms that are {\em singularly optimal}, i.e., algorithms that are {\em simultaneously} time and message {\em optimal}, for the funda…
Efficient Deterministic Leader Election for Programmable Matter
Fabien Dufoulon, Shay Kutten, William K. Moses
It was suggested that a programmable matter system (composed of multiple computationally weak mobile particles) should remain connected at all times since otherwise, reconnection i…
Byzantine Dispersion on Graphs
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
This paper considers the problem of Byzantine dispersion and extends previous work along several parameters. The problem of Byzantine dispersion asks: given robots, up to o…
Singularly Optimal Randomized Leader Election
Shay Kutten, William K. Moses, Gopal Pandurangan +1
This paper concerns designing distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the fundamental leader elec…
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
The problem of dispersion of mobile robots on a graph asks that robots initially placed arbitrarily on the nodes of an -node anonymous graph, autonomously move to reach a fi…