Dynamic Networks

We investigate algorithmic foundations of computation in dynamic networks, where connectivity changes over time. Our work focuses on designing and analyzing local algorithms for coordination tasks such as mutual exclusion and synchronization. We study how limited, local information can enable global coordination despite instability in the network structure. Recently, we have been developing synchronizers and coordination mechanisms that ensure consistency and progress in non-synchronous environments.

Refereed Conference Proceedings

• Indirect Coflow Scheduling. Alexander Lindermayr, Kirk Pruhs, Andréa W. Richa, and Tegan Wilson. In Structural Information and Communication Complexity: 33rd International Colloquium, SIROCCO 2026.
• Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics. Rida Bazzi, Anya Chaturvedi, Andréa W. Richa, and Peter Vargas. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 49:1-49:8, 2025.
• Invited Paper: Synchronization in Anonymous Networks Under Continuous Dynamics. Rida Bazzi, Anya Chaturvedi, Andréa W. Richa, and Peter Vargas. 2025. In Proceedings of the 7th Workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED ’25). Pages 11-15, 2025.
• On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks. Anya Chaturvedi, Joshua J. Daymude, Andréa W. Richa. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 330, pp. 15:1-15:16, 2025.
• Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. Joshua J. Daymude, Andréa W. Richa, Christian Scheideler. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 221, pp. 12:1-12:19,2022.

Other Publications

• Synchronization in Anonymous Networks Under Continuous Dynamics. Rida A. Bazzi, Cameron Bickley, Anya Chaturvedi, Andréa W. Richa, Peter Vargas. CoRR, abs/2506.08661, 2025

Invited Talks

• Invited Paper: Synchronization in Anonymous Networks Under Continuous Dynamics. Andréa W. Richa. Workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems (ApPLIED ’25 @ PODC ’25), Huatulco, Mexico. June 16, 2025.

Conference Talks

• Synchronization in Anonymous Networks Under Arbitrary Dynamics. Anya Chaturvedi. ACM Symposium on Principles of Distributed Computing (Student Spotlight Workshop ’26 @ PODC ’26), Egham, UK. July 6, 2026.
• Brief Announcement: Synchronization in Anonymous Networks Under Arbitrary Dynamics. Anya Chaturvedi. Symposium on Distributed Computing (DISC ’25), Berlin, Germany. October 29, 2025. 
• On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks. Anya Chaturvedi. Symposium on Algorithmic Foundations of Dynamic Networks (SAND ’25), Liverpool, UK. June 9, 2025.
• Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. Joshua J. Daymude. Symposium on Algorithmic Foundations of Dynamic Networks (SAND ’22), Online Event. March 29, 2022.

Poster Presentations

• Synchronization in Anonymous Networks Under Arbitrary Dynamics. Anya Chaturvedi. ACM Symposium on Principles of Distributed Computing (Student Spotlight Workshop ’26 @ PODC ’26), Egham, UK. July 6, 2026.