Devansh Shringi

Presently, I am a Second 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

Explicit construction of q+1 regular local Ramanujan graphs, for almost all prime-powers q

Journal of Computational Complexity(In Press)

Rishabh Batra,Nitin Saxena, Devansh Shringi

On the Multilinear Complexity of Associative Algebras

STACS 2023

Markus Bläser, Hendrik Mayer, Devansh Shringi

Talks

Derandomizing PIT Means Proving Circuit Lower Bounds

November 2020

Course: Computational Complexity Theory

Polynomial Identity Testing of Depth 4 Constant Top and Bottom Fanin

November 2019

Special Interest Group on Theoretical Aspects of Computer Science, IIT Kanpur

Introduction To Theoretical Computer Science

September 2019

Computer Science Fresher(ACA), IIT Kanpur

Other Professional Activities

CGWeek 2022

Reviewer

SIAM Journal on Computing (SICOMP)

Subreviewer under guidance of Prof Nitin Saxena

FOCS 22

Subreviewer under guidance of Prof Nitin Saxena

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