28 citations · 42 across the 10 of their papers we have counts for
22 papers
Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
William K. Moses, Amanda Redlich, Frederick Stock
We revisit the problem of \textsc{Broadcast}, introduced by Das, Giachoudis, Luccio, and Markou [OPODIS, 2020], where agents are initially placed on an node dynamic graph…
Towards Communication-Efficient Peer-to-Peer Networks
Khalid Hourani, William K. Moses, Gopal Pandurangan
We focus on designing Peer-to-Peer (P2P) networks that enable efficient communication. Over the last two decades, there has been substantial algorithmic research on distributed pro…
Time- and Communication-Efficient Overlay Network Construction via Gossip
Fabien Dufoulon, Michael Moorman, William K. Moses +1
We focus on the well-studied problem of distributed overlay network construction. We consider a synchronous gossip-based communication model where in each round a node can send a m…
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots
Anisur Rahaman Molla, Kaushik Mondal, William K. Moses
Over the years, much research involving mobile computational entities has been performed. From modeling actual microscopic (and smaller) robots, to modeling software processes on a…
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…
Awake Complexity of Distributed Minimum Spanning Tree
John Augustine, William K. Moses, Gopal Pandurangan
We study the distributed minimum spanning tree (MST) problem, a fundamental problem in distributed computing. It is well-known that distributed MST can be solved in $\tilde{O}(D+\s…