Shubhangi Saraf

Shubhangi Saraf is an Associate Professor in the Department of Computer Science and Mathematics at the University of Toronto. Previously, she held faculty positions at Rutgers University and was a postdoctoral researcher at the Institute for Advanced Study in Princeton. She earned her Ph.D. in EECS from MIT under the supervision of Madhu Sudan.

Her research focuses on theoretical computer science and discrete mathematics, with an emphasis on complexity theory, algebraic computation, error-correcting codes, and discrete geometry. Her work has been supported by prestigious grants including the Sloan Research Fellowship, NSF CAREER Award, and Simons Collaboration on Algorithms and Geometry.

Teaching highlights include courses such as Computational Complexity and Computability, Algebraic Complexity Theory, and Introduction to Combinatorics. She has advised current students like Deepanshu Kush and Devansh Shringi, and past students including Mrinal Kumar and Ben Lund.

Awards and honors include recognition for her contributions to coding theory and complexity analysis. Her research frequently bridges algebraic techniques with computational challenges, yielding impactful results in areas like polynomial identity testing and arithmetic circuit lower bounds.

She has led multiple academic initiatives, including special topics courses exploring algebraic gems in theoretical computer science and discrete mathematics. Her interdisciplinary work intersects with cryptography, combinatorics, and algorithm design, reflecting her broad scholarly contributions.