Devansh Shringi
I am a fifth-year Ph.D. student at the University of Toronto with the Theory Group, advised by Prof. Shubhangi Saraf. Before this, I obtained my BT-MT Dual Degree in Computer Science at the Indian Institute of Technology, Kanpur (IITK), working under the supervision of Prof. Nitin Saxena.
Check out my CV.
Research Interests
Algebraic Complexity, Computational Complexity, Computational Number Theory and Algebra, Pseudorandomness
Publications
-
Fast Algorithms for Low Rank Tensor Decomposition
Submitted ECCC
-
Demystifying Border of Structured Algebraic Circuits via Differential Equations
Submitted ECCC
-
Reconstruction of Depth-3 Arithmetic Circuits with Constant Top Fan-in
-
Reconstruction of Depth 3 Arithmetic Circuits with Top Fan-in 3
-
Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition
-
On the Multilinear Complexity of Associative Algebras
-
Explicit construction of q+1 regular local Ramanujan graphs, for almost all prime-powers q
Professional Experience
Acted as a reviewer for SOCG, SICOMP, FOCS, ICALP, ITCS, STACS, CCC, SODA
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 shringi99 at gmail dot com