Dispersion of Mobile Robots
(2022)
Other
Molla, A. R., & Moses Jr., W. K. (2022). Dispersion of Mobile Robots
Outputs (329)
Stability Analysis of a Quantum Network with Max-Weight Scheduling (2021)
Other
Vasantam, T., & Towsley, D. (2021). Stability Analysis of a Quantum Network with Max-Weight Scheduling
Proximity Based Load Balancing Policies on Graphs: A Simulation Study (2020)
Other
Panigrahy, N. K., Vasantam, T., Basu, P., & Towsley, D. (2020). Proximity Based Load Balancing Policies on Graphs: A Simulation Study
Composition Games for Distributed Systems: the EU Grant games (2011)
Other
Kutten, S., Lavi, R., & Trehan, A. (2011). Composition Games for Distributed Systems: the EU Grant games
Intelligent Cyber-Physical Systems for Autonomous Transportation (2022)
Book
Garg, S., Aujla, G. S., Kaur, K., & Ahmed Shah, S. H. (Eds.). (2022). Intelligent Cyber-Physical Systems for Autonomous Transportation. Springer, Cham
Software Defined Internet of Everything (2022)
Book
Aujla, G. S., Garg, S., Kaur, K., & Sikdar, B. (Eds.). (2022). Software Defined Internet of Everything. Springer, Cham. https://doi.org/10.1007/978-3-030-89328-6
Internet of Energy for Smart Cities: Machine Learning Models and Techniques (2021)
Book
Machine Learning Models and Techniques. CRC Press
Optimal (degree+1)-Coloring in Congested Clique (2023)
Presentation / Conference Contribution
Coy, S., Czumaj, A., Davies, P., & Mishra, G. (2023). Optimal (degree+1)-Coloring in Congested Clique. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (99:1-99:20). https://doi.org/10.4230/LIPIcs.ICALP.2023.46We consider the distributed complexity of the (degree+1)-list coloring problem, in which each node u of degree d(u) is assigned a palette of d(u) + 1 colors, and the goal is to find a proper coloring using these color palettes. The (degree+1)-list co... Read More about Optimal (degree+1)-Coloring in Congested Clique.
Distributed MIS in O(log log n) Awake Complexity (2023)
Presentation / Conference Contribution
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.3594574Maximal 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.
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm (2022)
Presentation / Conference Contribution
Dufoulon, F., Kutten, S., Moses Jr., W. K., Pandurangan, G., & Peleg, D. (2022). An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. In S. Scheideler (Ed.), . https://doi.org/10.4230/lipics.disc.2022.19
Efficient Deterministic Leader Election for Programmable Matter (2021)
Presentation / Conference Contribution
Dufoulon, F., Kutten, S., & Moses Jr., W. K. (2021). Efficient Deterministic Leader Election for Programmable Matter. . https://doi.org/10.1145/3465084.3467900
Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization (2023)
Presentation / Conference Contribution
Davies, P. (2023). Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization. . https://doi.org/10.1145/3583668.3594595In the study of radio networks, the tasks of broadcasting (propagating a message throughout the network) and leader election (having the network agree on a node to designate ‘leader’) are two of the most fundamental global problems, and have a long h... Read More about Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization.
Live Exploration with Mobile Robots in a Dynamic Ring, Revisited (2020)
Presentation / Conference Contribution
Mandal, S., Molla, A. R., & Moses Jr., W. K. (2020). Live Exploration with Mobile Robots in a Dynamic Ring, Revisited. In Algorithms for Sensor Systems (92-107). https://doi.org/10.1007/978-3-030-62401-9_7
Deterministic Dispersion of Mobile Robots in Dynamic Rings (2018)
Presentation / Conference Contribution
Agarwalla, A., Augustine, J., Moses Jr., W. K., Sankar K., M., & Sridhar, A. K. (2018). Deterministic Dispersion of Mobile Robots in Dynamic Rings. . https://doi.org/10.1145/3154273.3154294
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring (2023)
Presentation / Conference Contribution
Davies, P. (2023). Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (4273-4295). https://doi.org/10.1137/1.9781611977554.ch163The Lovász Local Lemma is a classic result in probability theory that is often used to prove the existence of combinatorial objects via the probabilistic method. In its simplest form, it states that if we have n ‘bad events’, each of which occurs wit... Read More about Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring.
Edge Computing Based Resource Supplementation for Software Defined Vehicular Networks (2022)
Presentation / Conference Contribution
Mittal, S., Garg, D., Bali, R. S., & Aujla, G. S. (2022). Edge Computing Based Resource Supplementation for Software Defined Vehicular Networks. . https://doi.org/10.1109/gcwkshps56602.2022.10008581
Sorting and Hypergraph Orientation under Uncertainty with Predictions (2023)
Presentation / Conference Contribution
Erlebach, T., de Lima, M., Megow, N., & Schlöter, J. (2023). Sorting and Hypergraph Orientation under Uncertainty with Predictions. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (5577-5585). https://doi.org/10.24963/ijcai.2023/619Learning-augmented algorithms have been attracting increasing interest, but have only recently been considered in the setting of explorable uncertainty where precise values of uncertain input elements can be obtained by a query and the goal is to min... Read More about Sorting and Hypergraph Orientation under Uncertainty with Predictions.
Singularly Near Optimal Leader Election in Asynchronous Networks (2021)
Presentation / Conference Contribution
Kutten, S., Moses Jr., W. K., Pandurangan, G., & Peleg, D. (2021). Singularly Near Optimal Leader Election in Asynchronous Networks. In S. Gilbert (Ed.), . https://doi.org/10.4230/lipics.disc.2021.27
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots (2020)
Presentation / Conference Contribution
Molla, A. R., Mondal, K., & Moses Jr., W. K. (2020). Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots. In Algorithms for Sensor Systems (154-169). https://doi.org/10.1007/978-3-030-62401-9_11
Dispersion of Mobile Robots (2018)
Presentation / Conference Contribution
Augustine, J., & Moses Jr., W. K. (2018). Dispersion of Mobile Robots. . https://doi.org/10.1145/3154273.3154293