Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Moses Jr., William K."'
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 protocols for building P2P networks with various desirable properties suc
Externí odkaz:
http://arxiv.org/abs/2406.16661
Autor:
Dogeas, Konstantinos, Erlebach, Thomas, Kammer, Frank, Meintrup, Johannes, Moses Jr, William K.
Publikováno v:
Leibniz International Proceedings in Informatics (LIPIcs), 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), Volume 297, pp. 55:1-55:18
Temporal graphs are graphs where the edge set can change in each time step, and the vertex set stays the same. Exploration of temporal graphs whose snapshot in each time step is a connected graph, called connected temporal graphs, has been widely stu
Externí odkaz:
http://arxiv.org/abs/2312.07140
Autor:
Moses Jr., William K., Redlich, Amanda
In this paper, we look at and expand the problems of dispersion and Byzantine dispersion of mobile robots on a graph, introduced by Augustine and Moses~Jr.~[ICDCN~2018] and by Molla, Mondal, and Moses~Jr.~[ALGOSENSORS~2020], respectively, to graphs w
Externí odkaz:
http://arxiv.org/abs/2311.01511
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 network, many important problems have been studied in this context. G
Externí odkaz:
http://arxiv.org/abs/2305.01753
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 networks, such algorithms are known for fundamental distributed computin
Externí odkaz:
http://arxiv.org/abs/2210.01173
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+\sqrt{n})$ rounds in the standard CONGEST model (where $n$ is the networ
Externí odkaz:
http://arxiv.org/abs/2204.08385
Maximal Independent Set (MIS) is one of the fundamental and most well-studied problems in distributed graph algorithms. Even after four decades of intensive research, the best-known (randomized) MIS algorithms have $O(\log{n})$ round complexity on ge
Externí odkaz:
http://arxiv.org/abs/2204.08359
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 fundamental leader election problem in {\em asynchronous} networks. Kutten
Externí odkaz:
http://arxiv.org/abs/2108.02197
It was suggested that a programmable matter system (composed of multiple computationally weak mobile particles) should remain connected at all times since otherwise, reconnection is difficult and may be impossible. At the same time, it was not clear
Externí odkaz:
http://arxiv.org/abs/2106.01108
This paper considers the problem of Byzantine dispersion and extends previous work along several parameters. The problem of Byzantine dispersion asks: given $n$ robots, up to $f$ of which are Byzantine, initially placed arbitrarily on an $n$ node ano
Externí odkaz:
http://arxiv.org/abs/2102.07528