Reseach Talks
Some research talks I have given (list will be updated only rarely !).- On CC^0 Lower Bounds for AND via Torus Polynomials -
- Aug 17, 2026, Talk at Workshop on Circuits, Communication and Proofs, International Center for Theoretical Studies (ICTS-TIFR), Bengaluru.
- Aug 25, 2026, Conference Presentation at International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), Paris.
- On Saving Energy in Boolean Circuits via
Negations -
(Online) Conference Presentation at FCT 2025.
- Sep 16, 2025,
25th International Symposium on Fundamentals of Computation Theory
(FCT 2025) - Sep 15-17, 2025
- Sep 16, 2025,
25th International Symposium on Fundamentals of Computation Theory
(FCT 2025) - Sep 15-17, 2025
- Recent Surprises on Tree Evaluation Problem -
This is a survey talk of the recent ideas on TEP problem.
- Jan 16, 2025,
Advances in Modern Complexity Theory (Complexity Theory Update Meeting) - Jan 23-35, 2025
- Jan 16, 2025,
Advances in Modern Complexity Theory (Complexity Theory Update Meeting) - Jan 23-35, 2025
- Depth Lower Bounds and Non-monotonicity - The Case of Sparsely Oriented Circuits
- May 24, 2016,
Workshop on Low-depth Complexity,
Organized as a part of A Special Semester on Computational and Proof Complexity
Chebyshev Laboratory, St.Petersburg, Russia.
- May 24, 2016,
Workshop on Low-depth Complexity,
- Weighting Schemes and NL vs UL Problem
- Jan 9, 2015, Indo-UK Workshop on Computational Complexity,
Institute of Mathematical Sciences, Chennai, India.
- Jan 9, 2015, Indo-UK Workshop on Computational Complexity,
- Arithmetic Circuit Lower bounds via (Polynomial) Partial Derivative Matrix
- Jun 28, 2013, The Institute of Mathematical Sciences, Chennai, India.
- Jun 28, 2013, The Institute of Mathematical Sciences, Chennai, India.
- Isomorphism Testing of Polynomials
- Aug 17, 2012, Workshop on Complexity and Logic Dept of CSE, IIT Kanpur
(a three-day workshop on Computational Complexity to celebrate the sixtieth birthday of Somenath Biswas).
- Aug 17, 2012, Workshop on Complexity and Logic Dept of CSE, IIT Kanpur
- Matrix Rigidity and Complexity of Linear Transformations
- Mar 24, 2011, Department of Mathematics, IIT Madras, Chennai, India.
- Identity Testing of Pi-Ordered Branching Programs
- Dec 14, 2010, Conference Talk at FSTTCS 2010, Chennai, India.
- Treewidth of Circuits
- Aug 4, 2010, Aarhus-Chennai Computational Complexity Workshop Aarhus University, Aarhus, Denmark.
- Two Algebraic Problems related to Circuit Lower
Bounds
- May 17, 2010, Indian Institute of Science, Bangalore, India
- Apr 25, 2011, Indian Institute of Technology Madras, Chennai, India
- Using Elimination Theory to Construct Rigid Matrices
- Dec 14, 2009 : Conference Talk at FSTTCS 2009, Dec 14-17,
Indian Institute of Technology, Kanpur, India
- Dec 14, 2009 : Conference Talk at FSTTCS 2009, Dec 14-17,
- Complexity of Matroid Isomorphism
Problem
-
Dec 14, 2008, Workshop in DM-TCS 2008, Dec 12-14
Institute of Advanced Studies, NTU, Singapore. - Mar 27, 2009: Workshop on
Current Trends in
Algorithms, Complexity Theory, and Cryptography
Mar 22-27, 2009, ITCS, Tsinghua University, Beijing, China. - Aug 22, 2009: Conference Talk at CSR 2009, Aug 18-23, 2009
Sobolev Insititute of Mathematics, Novosibirsk, Russia.
-
Dec 14, 2008, Workshop in DM-TCS 2008, Dec 12-14
- Complexity Theoretic Aspects of Rank, Rigidity and Circuit Evaluation
- Doctoral thesis defense talk.
The Institute of Mathematical Sciences, Chennai, India.
- Doctoral thesis defense talk.
- Tradeoffs and Lower bounds in Circuit Complexity
- Nov 19, 2008 (Shorter version): Collaborator's workshop, Nov 19, 2008,
Department of Electrical Engineering, NTU, Singapore.
- Apr 1, 2009 (Longer version):
Joint workshop on Theoretical CS,
iTcs and GSiSSchool of Information Sciences, Tohoku University, Japan.
- Nov 19, 2008 (Shorter version): Collaborator's workshop, Nov 19, 2008,
- Matrix Rigidity: Computation and
(Algebraically) Explicit Constructions
- Sep 4, 2008 : Workshop on Algebraic Complexity Theory, Sep 3-5
Dept. of Computer Science, University of Aarhus, Denmark.
- Sep 4, 2008 : Workshop on Algebraic Complexity Theory, Sep 3-5
- An Algebraic Characterisation of Logspace Computation
- Jul 16, 2008, Department of Computer Science and Engineering,
National Institute of Technology, Calicut, India.
- Jul 16, 2008, Department of Computer Science and Engineering,
- Matrix Rank, Rigidity and Complexity
- Mar 5, 2008 - Institute for Theoretical Computer
Science(ITCS),
Tsinghua University, Beijing, China.
- Mar 5, 2008 - Institute for Theoretical Computer
Science(ITCS),
- Complexity of Changing Matrix
Rank
- Workshop on Computational, Descriptive and Proof
Complexity, and Algorithms
WCDPCA 2007, French-Russian Poncelet Laboratory, Moscow, Russia, Aug 30, 2007
- Workshop on Computational, Descriptive and Proof
Complexity, and Algorithms
- Complexity of Computing
Matrix Rank and Rigidity
- IRISS 2007
- Jan 4, 2007 - IIIT, Hyderabad
- Techvista 2007 - Jan 23, 2007 - IISc/MSR, Bangalore.
(poster)
- ISW 2007
- Mar 5, 2007 - IMSc, Chennai. (slides)
- CSR 2007 - Sep 4, 2007, Ekaterinburg,
Russia. (slides)
- (survey talk) - August 24, 2006, IMSc Chennai.
- IRISS 2007
- Jan 4, 2007 - IIIT, Hyderabad
- Evaluating Monotone Circuits
- Feb 16, ISW 2006, IMSc Chennai, India.
Last update: Tue 15 Sep 2026 19:15 IST