New Bounds for Energy Complexity of Boolean Functions IRISS 2019 @ Rajagiri School of Engineering & Technology, Kochi (February 6, 2019)
Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps -
CALDAM 2018 @ IIT Guwahati (February 17, 2018)
Theory Meet (tMeet) @ CS Dept., IIT Madras (January 30, 2018)
Recent breakthrough in Capset Problem by Croot-Lev-Pack,
Ellenberg-Gijswijt (expository) - September 6, 2016
Lab Talk, ACT Lab @ CS Dept., IIT Madras
Characterization and Lower Bounds for Branching Program Size using Projective Dimension -
Chennai Theory Day 2016 @ Chennai Mathematical Institute (April 29, 2016)
FSTTCS 2016 @ Chennai Mathematical Institute (December 15, 2016)
Majority is incompressible by AC0[p] circuits - Igor Carboni Oliveira, Rahul Santhanam - July 01, 2015
Complexity Theory Meet (co-tMeet) @ CS Dept., IIT Madras
Shrinkage Exponent of Boolean Formulas from Quantum Query Complexity - Avishay Tal - May 13, 2015
Complexity Theory Meet (co-tMeet) @ CS Dept., IIT Madras
Regularity lemma: A short proof via Linear Algebra - April 21, 2014
Graph Theory Seminar @ Math Dept., IIT Madras
A Proof of Graham Pollak Theorem - October 30, 2013
Graph Theory Seminar @ Math Dept., IIT Madras
Primes is in P - The AKS algorithm - October 23, 2012
Theory Meet (tMeet) @ CS Dept., IIT Madras
Theoreticians from CREC/NITC
Nithin and me are maintaining of a list of
alumni from NIT Calicut (formerly Regional Engineering College, Calicut)
who work/pursue higher studies in the area of
Mathematics or Theoretical Computer Science. The list is available
here.