Anya Chaturvedi
-
699 S Mill Ave #119 BYENG 498 Tempe, AZ 85281
-
Mail code: 8809Campus: Tempe
-
Student Information
Graduate StudentComputer Science
Ira A Fulton Engineering
I’m a Ph.D. student in Computer Science at Arizona State University, working in the area of theoretical computer science, with a focus on distributed algorithms. My research explores how collections of simple, memory-limited agents can coordinate in dynamic and anonymous networks.
I completed my M.S. in Computer Science at ASU, where my thesis—Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands—proposed a polynomial-time randomized approximation algorithm for maximizing weighted throughput in multicommodity flow networks, allowing only minimal violations of capacity constraints. The work also included a deterministic derandomization via pessimistic estimators and a proof-of-concept empirical evaluation.
After earning my M.S., I worked at Intel for two years as an Automation Engineer. That experience reinforced what I had already observed: many powerful theoretical results remain untapped in real-world systems. My Ph.D. is an opportunity to help bridge this gap—bringing distributed computing theory closer to practical, resource-constrained environments.
I received my B.Tech. in Information Technology from MNNIT Allahabad.
-
Ph.D. in Computer Science (2022 - Present)
Arizona State Unveristy, Tempe, Arizona
-
M.S. in Computer Science (2018 - 2020)
Arizona State Unveristy, Tempe, Arizona
-
B.Tech. in Information Technology (2014 - 2018)
Motilal Nehru National Institute of Technology, Allahabad, India
- Distributed Algorithms
- Randomized Algorithms
- Combinatorial Algorithms
- Approximation Algorithms
1. Anya Chaturvedi, Chandra Chekuri, Andr´ea W. Richa, Stefan Schmid, Matthias Rost, and Jamison Weber. Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands. ACM SIGMETRICS Performance Evaluation Review, 49(3):22–27, 2022. doi: https://doi.org/10.1145/3529113.3529121
2. Anya Chaturvedi, Chandra Chekuri, Mengxue Liu, Andr´ea W. Richa, Matthias Rost, Stefan Schmid, and Jamison Weber. Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands. IEEE/ACM Transactions on Networking, 32(2):1435–1450, 2024. doi: https://doi.org/10.1109/tnet.2023.3325437
3. Anya Chaturvedi, Joshua J. Daymude, and Andr´ea W. Richa. On the Runtime of Local Mutual Exclusion for Anonymous Dynamic Networks. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2025), volume 330 of Leibniz International Proceedings in Informatics (LIPIcs), pages 15:1—15:16, 2025. doi: https://doi.org/10.4230/LIPIcs.SAND.2025.15
4. Devendra Parkar, Anya Chaturvedi, Andr´ea W. Richa, and Joshua J. Daymude. Finding Maximum Independent Sets in Dynamic Graphs using Unsupervised Learning. arXiv.org, 2025. URL: https://arxiv.org/abs/2505.13754
5. Rida Bazzi, Anya Chaturvedi, Andr´ea W. Richa, and Peter Vargas. Synchronization in Anonymous Networks Under Continuous Dynamics. arXiv.org, 2025. URL: https://arxiv.org/abs/2506.08661