Anya Chaturvedi

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.