Skip to main content

Research Repository

Advanced Search

Outputs (27)

Awake Complexity of Distributed Minimum Spanning Tree (2024)
Conference Proceeding
Augustine, J., Moses Jr, W. K., & Pandurangan, G. (in press). Awake Complexity of Distributed Minimum Spanning Tree.

The \emph{awake complexity} of a distributed algorithm measures the number of rounds in which a node is awake. When a node is not awake, it is {\em sleeping} and does not do any computation or communication and spends very little resources. Reduci... Read More about Awake Complexity of Distributed Minimum Spanning Tree.

Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd (2024)
Conference Proceeding
Moses Jr., W. K., & Redlich, A. (2024). Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd. In ICDCN '24: Proceedings of the 25th International Conference on Distributed Computing and Networking (400-405). https://doi.org/10.1145/3631461.3632310

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... Read More about Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd.

Efficient live exploration of a dynamic ring with mobile robots (2023)
Journal Article
Mandal, S., Molla, A. R., & Moses Jr., W. K. (2023). Efficient live exploration of a dynamic ring with mobile robots. Theoretical Computer Science, 980, Article 114201. https://doi.org/10.1016/j.tcs.2023.114201

The graph exploration problem requires a group of mobile robots, initially placed arbitrarily on the nodes of a graph, to work collaboratively to explore the graph such that each node is eventually visited by at least one robot. One important require... Read More about Efficient live exploration of a dynamic ring with mobile robots.

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots (2023)
Conference Proceeding
Molla, A. R., Mondal, K., & Moses Jr., W. K. (2023). Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. In 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (47-57). https://doi.org/10.1109/IPDPS54959.2023.00015

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... Read More about Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots.

Distributed MIS in O(log log n) Awake Complexity (2023)
Conference Proceeding
Dufoulon, F., Moses Jr., W. K., & Pandurangan, G. (2023). Distributed MIS in O(log log n) Awake Complexity. In A. Nolin (Ed.), . https://doi.org/10.1145/3583668.3594574

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 genera... Read More about Distributed MIS in O(log log n) Awake Complexity.