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

• Dufoulon, F., Moorman, M., Moses Jr., W. K., & Pandurangan, G. (2024, January). Time- and Communication-Efficient Overlay Network Construction via Gossip. Presented at ITCS 2024: Innovations in Theoretical Computer Science (ITCS), Berkeley, California
• Dogeas, K., Erlebach, T., Kammer, F., Meintrup, J., & Moses Jr, W. K. (2024, July). Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. Presented at 51st EATCS International Colloquium on Automata, Languages and Programming, Tallinn, Estonia
• 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
• 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
• 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
• Dufoulon, F., Moses Jr., W. K., & Pandurangan, G. (2023, June). Distributed MIS in O(log log n) Awake Complexity. Presented at PODC '23: 2023 ACM Symposium on Principles of Distributed Computing, Orlando, Florida
• Ajieren, E., Hourani, K., Moses Jr., W. K., & Pandurangan, G. (2022, December). Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation. Presented at 23rd International Conference on Distributed Computing and Networking
• Dufoulon, F., Kutten, S., Moses Jr., W. K., Pandurangan, G., & Peleg, D. (2022, December). An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. Presented at 36th International Symposium on Distributed Computing (DISC 2022)
• Augustine, J., Moses Jr., W. K., & Pandurangan, G. (2022, December). 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
• Kutten, S., Moses Jr., W. K., Pandurangan, G., & Peleg, D. (2021, December). Singularly Near Optimal Leader Election in Asynchronous Networks. Presented at 35th International Symposium on Distributed Computing (DISC 2021)
• Dufoulon, F., Kutten, S., & Moses Jr., W. K. (2021, December). Efficient Deterministic Leader Election for Programmable Matter. Presented at Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing
• 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)
• 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)
• Mandal, S., Molla, A. R., & Moses Jr., W. K. (2020, December). Live Exploration with Mobile Robots in a Dynamic Ring, Revisited
• Molla, A. R., Mondal, K., & Moses Jr., W. K. (2020, December). Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots
• Molla, A. R., & Moses Jr., W. K. (2019, December). Dispersion of Mobile Robots: The Power of Randomness
• 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)
• Agarwalla, A., Augustine, J., Moses Jr., W. K., Sankar K., M., & Sridhar, A. K. (2018, December). Deterministic Dispersion of Mobile Robots in Dynamic Rings. Presented at Proceedings of the 19th International Conference on Distributed Computing and Networking
• 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
• 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
• Moses Jr., W. K., & Pandu Rangan, C. (2011, December). Rational Secret Sharing with Honest Players over an Asynchronous Channel

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
• 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
• 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
• 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
• 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 and its applications, 3(6), https://doi.org/10.5121/ijnsa.2011.3601

Other (Print)

• Molla, A. R., & Moses Jr., W. K. (2022). Dispersion of Mobile Robots