Shubhangi Saraf

Shubhangi Saraf is a Professor in the Department of Mathematics at the University of Toronto. Her research interests include theoretical computer science, particularly in areas such as computational complexity and algorithms. She is affiliated with the university's mathematics department and can be contacted via email at ssaraf@math.toronto.edu. Her professional profile is available at https://www.mathematics.utoronto.ca/people/directories/all-faculty/shubhangi-saraf.

Shubhangi Saraf is a researcher in theoretical computer science and discrete mathematics. Her work focuses on the intersection of these fields, with an emphasis on coding theory, complexity theory, and combinatorics. She has contributed to the development of high-rate codes with sublinear-time decoding, locally testable and correctable codes, and the analysis of Kakeya sets. Her research also explores polynomial identity testing, arithmetic circuits, and the limits of depth reduction for arithmetic formulas. Saraf's publications often address the theoretical foundations of computational problems and their applications in algorithm design and complexity analysis.