19 citations · 35 across the 14 of their papers we have counts for
3 papers · 1 filter
Recurrent Problems in the LOCAL model
Akanksha Agrawal, John Augustine, David Peleg +1
The paper considers the SUPPORTED model of distributed computing introduced by Schmid and Suomela [HotSDN'13], generalizing the LOCAL and CONGEST models. In this framework, multipl…
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…
The Power of Small Coalitions under Two-Tier Majority on Regular Graphs
Pavel Chebotarev, David Peleg
In this paper, we study the following problem. Consider a setting where a proposal is offered to the vertices of a given network , and the vertices must conduct a vote and decid…