This page lists selected talks and presentations that I have given, including course presentations and academic talks.
1. Arithmetic Circuit Lower Bounds via Elusive Maps: Explicit Constructions and New Approaches [Slides]
Context: Course Project Presentation (Project/Dissertation Phase 2)
Venue: Indian Institute of Technology Palakkad
Date: 11 May 2026
Description: This is a continuation of the work in Phase 2, covering our results and some observations on Raz’s construction discussed earlier in Phase 1. In this phase, we studied new approaches to proving elusiveness and refined aspects of Raz’s construction. We explored the structural properties of elusive polynomial maps that lead to arithmetic circuit lower bounds. We also identified conditions under which Raz’s lower bound can be improved using r-wise algebraic independence.
2. Arithmetic Circuit Lower Bounds via Explicit Construction of Elusive Maps [Slides]
Context: Course Project Presentation (Project/Dissertation Phase I)
Venue: Indian Institute of Technology Palakkad
Date: 3 December 2025
Description: This presentation introduced arithmetic circuits and the problem of proving explicit lower bounds. It focused on Raz’s framework of elusive polynomial maps and presented explicit constructions preserving elusiveness, leading to lower bounds for arithmetic circuits.
2. Half Integrality of Minimum Vertex Cover and Nemhauser - Trotter Theorem [Slides]
Context: Course Presentation (CS6002)
Venue: Indian Institute of Technology Palakkad
Date: 6 November 2025
Description: This presentation discussed the LP formulation of the Minimum Cost Vertex Cover problem, focusing on the half-integrality property of its LP relaxation. It also covered the Nemhauser–Trotter theorem and its implications for approximation algorithms for vertex cover.
3. Homomorphisms to prove regularity/non-regularity of languages. [Slides]
Context: Course Presentation (CS3050)
Venue: Indian Institute of Technology Palakkad
Date: 9 November 2024
Description: The language L_1 = {0^n1^n | n ≥ 0} is not regular and can be argued via pumping lemma. The language L_2 = {0^n#1^n | n ≥ 0} which “looks" similar to L_1 is also not regular. Is it a coincidence or can we formalize this ? This presentation demonstrates how homomorphisms and inverse homomorphisms can be used to argue the regularity and non-regularity of languages.