Staff profile

I am an Assistant Professor in the Department of Computer Science. Prior to this, I was a Post Doctoral Fellow at the University of Houston (2021-2022) and a Post Doctoral Fellow at the Technion (2018-2020). Before that, I completed my Ph.D. at the Indian Institute of Technology Madras (2012-2018).

• Distributed Algorithms
• Movement and Computing
• Biologically Inspired Computing
• Peer to Peer Network Algorithms
• Algorithms

Conference Paper

• Brief Announcement: Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents
  
  Moses, W. K., Redlich, A., & Stock, F. (2025, June 2). Brief Announcement: Broadcast via Mobile Agents in a Dynamic Network: Interplay of Graph Properties & Agents. Presented at Leibniz International Proceedings in Informatics Lipics, Liverpool, UK. https://doi.org/10.4230/LIPIcs.SAND.2025.17
• Towards Communication-Efficient Peer-to-Peer Networks
  
  Hourani, K., Moses Jr., W. K., & Pandurangan, G. (2024). Towards Communication-Efficient Peer-to-Peer Networks. In 32nd Annual European Symposium on Algorithms (ESA 2024) (pp. 71:1-71:15). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2024.71
• Awake Complexity of Distributed Minimum Spanning Tree
  
  Augustine, J., Moses Jr, W. K., & Pandurangan, G. (2024). Awake Complexity of Distributed Minimum Spanning Tree. In Structural Information and Communication Complexity (pp. 45-63). Springer. https://doi.org/10.1007/978-3-031-60603-8_3
• Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
  
  Dogeas, K., Erlebach, T., Kammer, F., Meintrup, J., & Moses Jr, W. K. (2024). Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. In Proceedings of the 51st EATCS International Colloquium on Automata, Languages and Programming (pp. 55:1-55:18). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2024.55
• Time- and Communication-Efficient Overlay Network Construction via Gossip
  
  Dufoulon, F., Moorman, M., Moses Jr., W. K., & Pandurangan, G. (2024). Time- and Communication-Efficient Overlay Network Construction via Gossip. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) (pp. 42:1-42:23). Schloss Dagstuhl. https://doi.org/10.4230/LIPIcs.ITCS.2024.42
• Dispersion, Capacitated Nodes, and the Power of a Trusted Shepherd
  
  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 (pp. 400-405). ACM. https://doi.org/10.1145/3631461.3632310
• Distributed MIS in O(log log n) Awake Complexity
  
  Dufoulon, F., Moses Jr., W. K., & Pandurangan, G. (2023). Distributed MIS in O(log log n) Awake Complexity (A. Nolin, Ed.). ACM. https://doi.org/10.1145/3583668.3594574
• Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds
  
  Augustine, J., Moses Jr., W. K., & Pandurangan, G. (2022). Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. Presented at Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. https://doi.org/10.1145/3519270.3538459
• Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation
  
  Ajieren, E., Hourani, K., Moses Jr., W. K., & Pandurangan, G. (2022). Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation. Presented at 23rd International Conference on Distributed Computing and Networking. https://doi.org/10.1145/3491003.3491011
• An Almost Singularly Optimal Asynchronous Distributed MST Algorithm
  
  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.), Leibniz International Proceedings in Informatics (LIPIcs) (pp. 19:1-19:24). Schloss Dagstuhl -- Leibniz-Zentrum f{\’u}r Informatik. https://doi.org/10.4230/lipics.disc.2022.19
• Singularly Near Optimal Leader Election in Asynchronous Networks
  
  Kutten, S., Moses Jr., W. K., Pandurangan, G., & Peleg, D. (2021). Singularly Near Optimal Leader Election in Asynchronous Networks. In S. Gilbert (Ed.), Leibniz International Proceedings in Informatics (LIPIcs) (pp. 27:1-27:18). Schloss Dagstuhl -- Leibniz-Zentrum f{\’u}r Informatik. https://doi.org/10.4230/lipics.disc.2021.27
• Byzantine Dispersion on Graphs
  
  Molla, A. R., Mondal, K., & Moses Jr., W. K. (2021). Byzantine Dispersion on Graphs. Presented at 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps49936.2021.00103
• Efficient Deterministic Leader Election for Programmable Matter
  
  Dufoulon, F., Kutten, S., & Moses Jr., W. K. (2021). Efficient Deterministic Leader Election for Programmable Matter. Presented at Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. https://doi.org/10.1145/3465084.3467900
• Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
  
  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 (pp. 154-169). https://doi.org/10.1007/978-3-030-62401-9_11
• Live Exploration with Mobile Robots in a Dynamic Ring, Revisited
  
  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 (pp. 92-107). https://doi.org/10.1007/978-3-030-62401-9_7
• Singularly Optimal Randomized Leader Election
  
  Kutten, S., Moses Jr., W. K., Pandurangan, G., & Peleg, D. (2020). Singularly Optimal Randomized Leader Election. In H. Attiya (Ed.), Leibniz International Proceedings in Informatics (LIPIcs) (pp. 22:1-22:18). Schloss Dagstuhl--Leibniz-Zentrum f{\’u}r Informatik. https://doi.org/10.4230/lipics.disc.2020.22
• Dispersion of Mobile Robots: The Power of Randomness
  
  Molla, A. R., & Moses Jr., W. K. (2019). Dispersion of Mobile Robots: The Power of Randomness. In Theory and Applications of Models of Computation (pp. 481-500). https://doi.org/10.1007/978-3-030-14812-6_30
• Deterministic Leader Election in Programmable Matter
  
  Emek, Y., Kutten, S., Lavi, R., & Moses Jr., W. K. (2019). Deterministic Leader Election in Programmable Matter. In C. Baier, I. Chatzigiannakis, P. Flocchini, & S. Leonardi (Eds.), Leibniz International Proceedings in Informatics (LIPIcs) (p. 140:1--140:14). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/lipics.icalp.2019.140
• Dispersion of Mobile Robots
  
  Augustine, J., & Moses Jr., W. K. (2018). Dispersion of Mobile Robots. Presented at Proceedings of the 19th International Conference on Distributed Computing and Networking. https://doi.org/10.1145/3154273.3154293
• Deterministic Dispersion of Mobile Robots in Dynamic Rings
  
  Agarwalla, A., Augustine, J., Moses Jr., W. K., Sankar K., M., & Sridhar, A. K. (2018). Deterministic Dispersion of Mobile Robots in Dynamic Rings. Presented at Proceedings of the 19th International Conference on Distributed Computing and Networking. https://doi.org/10.1145/3154273.3154294
• Balanced Allocation: Patience is not a Virtue
  
  Augustine, J., Moses Jr., W. K., Redlich, A., & Upfal, E. (2016). Balanced Allocation: Patience is not a Virtue. Presented at Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. https://doi.org/10.1137/1.9781611974331.ch48
• Rational Secret Sharing with Honest Players over an Asynchronous Channel
  
  Moses Jr., W. K., & Pandu Rangan, C. (2011). Rational Secret Sharing with Honest Players over an Asynchronous Channel. In Advances in Network Security and Applications. https://doi.org/10.1007/978-3-642-22540-6_40

Journal Article

• Efficient live exploration of a dynamic ring with mobile robots
  
  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
• Balanced Allocation: Patience Is Not a Virtue
  
  Augustine, J., Moses Jr., W. K., Redlich, A., & Upfal, E. (2022). Balanced Allocation: Patience Is Not a Virtue. SIAM Journal on Computing, 51(6). https://doi.org/10.1137/17m1155375
• Deterministic protocols in the SINR model without knowledge of coordinates
  
  Moses Jr., W. K., & Vaya, S. (2021). Deterministic protocols in the SINR model without knowledge of coordinates. Journal of Computer and System Sciences, 115. https://doi.org/10.1016/j.jcss.2020.06.002
• Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
  
  Molla, A. R., Mondal, K., & Moses Jr., W. K. (2021). Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots. Theoretical Computer Science, 887. https://doi.org/10.1016/j.tcs.2021.07.008
• Rational Secret Sharing Over an Asynchronous Broadcast Channel With Information Theoretic Security
  
  Moses Jr., W. K., & Pandu Rangan, C. (2011). Rational Secret Sharing Over an Asynchronous Broadcast Channel With Information Theoretic Security. International Journal of Network Security & Its Applications, 3(6). https://doi.org/10.5121/ijnsa.2011.3601

Other (Print)

• Dispersion of Mobile Robots
  
  Molla, A. R., & Moses Jr., W. K. (2022). Dispersion of Mobile Robots (pp. 217-220). ICDCN 2022: 23rd International Conference on Distributed Computing and Networking.