Skip to main content

Research Repository

Advanced Search

Outputs (28)

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.

Deterministic Leader Election in Programmable Matter
Presentation / Conference Contribution
Emek, Y., Kutten, S., Lavi, R., & Moses Jr., W. K. (2019, December). Deterministic Leader Election in Programmable Matter. Presented at 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)

Towards Communication-Efficient Peer-to-Peer Networks
Presentation / Conference Contribution
Hourani, K., Moses Jr., W. K., & Pandurangan, G. (2024, September). Towards Communication-Efficient Peer-to-Peer Networks. Presented at 32nd Annual European Symposium on Algorithms (ESA 2024), Egham, United Kingdom

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... Read More about Towards Communication-Efficient Peer-to-Peer Networks.

Balanced Allocation: Patience is not a Virtue
Presentation / Conference Contribution
Augustine, J., Moses Jr., W. K., Redlich, A., & Upfal, E. (2016, December). Balanced Allocation: Patience is not a Virtue. Presented at Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots
Presentation / Conference Contribution
Molla, A. R., Mondal, K., & Moses Jr., W. K. (2023, May). Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. Presented at 37th IEEE International Parallel & Distributed Processing Symposium, St. Petersburg, Florida, USA

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.

Singularly Optimal Randomized Leader Election
Presentation / Conference Contribution
Kutten, S., Moses Jr., W. K., Pandurangan, G., & Peleg, D. (2020, December). Singularly Optimal Randomized Leader Election. Presented at 34th International Symposium on Distributed Computing (DISC 2020)

Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd
Presentation / Conference Contribution
Moses Jr., W. K., & Redlich, A. (2024, January). Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd. Presented at 25th International Conference on Distributed Computing and Networking, Chennai, India

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.

Awake Complexity of Distributed Minimum Spanning Tree
Presentation / Conference Contribution
Augustine, J., Moses Jr, W. K., & Pandurangan, G. (2024, May). Awake Complexity of Distributed Minimum Spanning Tree. Presented at SIROCCO 2024: 31st International Colloquium On Structural Information and Communication Complexity, Vietri sul Mare, Salerno, Italy

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.

Byzantine Dispersion on Graphs
Presentation / Conference Contribution
Molla, A. R., Mondal, K., & Moses Jr., W. K. (2021, December). Byzantine Dispersion on Graphs. Presented at 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)

Dispersion of Mobile Robots
Presentation / Conference Contribution
Augustine, J., & Moses Jr., W. K. (2018, December). Dispersion of Mobile Robots. Presented at Proceedings of the 19th International Conference on Distributed Computing and Networking