Research Talks
Introduction to Computational Complexity Theory, Quantum Computing Semester, Dr. F.C. Kohli Centre of Excellence, Chennai Mathematical Institute, Jan 2024.
Uncertainty thy name is entropy, Institute of Mathematical Sciences(IMSc), October 2023.
Exploring Multiple Facets of Algebraic Computation, Alum@Alma, IIT Madras, September 2023.
Algebraic Complexity Theory - A gripping tale of two polynomials, Institute of Mathematical Sciences(IMSc), April 2021.
A walk-through the recent Progress on Matrix Rigidity at STCS Symposium 2020, TIFR Mumbai.
Proving super-polynomial lower bounds for syntactic multilinear branching programs: Approaches and Challenges at the ICTS-Workshop on Algebraic Complexity Theory, WACT 2019, ICTS-Bengaluru.
On the computation of multilinear polynomials at Chennai Mathematical Institute, 2019.
Lower Bounds for Multilinear Circuit Models and Linear Projections of the Vandermonde Polynomial at IIT Madras, 2019 (PhD Defense).
On the Structure and Lower Bounds for Multilinear Branching Programs at TIFR Mumbai, 2018.
An Introduction to Lie Algebra at Complexity Theory Meet IIT Madras, 2018.
Lower Bounds for Special Cases of Syntactic Multilinear ABPs at International Computing and Combinatorics Conference (COCOON 2018), Qingdao, China.
Linear Equivalence to Vandermonde Polynomials at IIT Madras, 2017.
Sum and Sum of Products of Read-Once Formulas at Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), CMI, India.
Limitations of sum of products of Read-Once Polynomials at the Chennai Theory Day 2016, CMI.