Devansh Shringi

I am a Third-year Ph.D. Student at University of Toronto with Theory Group, advised by Prof. Shubhangi Saraf. Before this, I obtained my BT-MT Dual Degree in Computer Science at Indian Institute of Technology, Kanpur (IITK), working under supervision of Prof. Nitin Saxena.
Check out my CV here.

Research Interests


Algebraic Complexity, Computational Complexity, Computational Number Theory and Algebra, Pseudorandomness

Publications

Paper Authors Conference/Jounral ECCC/arxiv/Open Access Slides/Video
Reconstruction of Depth 3 Arithmetic Circuits with Top Fan-in 3 Shubhangi Saraf, Devansh Shringi Submitted ECCC
Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition Vishwas Bhargava, Devansh Shringi Submitted ECCC
On the Multilinear Complexity of Associative Algebras Markus Bläser, Hendrik Mayer, Devansh Shringi STACS 2023 Open Access
Explicit construction of q+1 regular local Ramanujan graphs, for almost all prime-powers q Rishabh Batra, Nitin Saxena, Devansh Shringi Journal of Computational Complexity 2023 Open Access Slides

Professional Experience

Acted as Reviewer for SOCG, SICOMP, FOCS, ICALP

Other write ups

Project Title Work with Report
Master Thesis, IITK Constructions over Finite Fields with Applications to Local Ramanujan Graph and Algebraic Dependence Nitin Saxena Thesis
Intern, Saarland University On Blackbox Polynomial Identity Testing of Sparse polynomials Markus Bläser Report
UG project, IITK Polynomial Identity Testing for Depth 4 Circuits Constant Top and Bottom Fan-in Nitin Saxena Report

Contact


Email
devansh at cs dot toronto dot edu
devansh dot shringi at mail dot utoronto dot ca
devansh dot shringi99 at gmail dot com