Talks
$\mathsf{BPL}\subseteq\mathsf{SC}$: Nisan's Pseudorandom Generator for $\mathsf{BPL}$
Course-Work presentation (TIFR): Pseudorandomness. Paper by Noam Nisan, 1992
Subspace Polynomials and List Decoding of Reed Solomon Codes
Course-Work presentation (TIFR): Topics in Coding Theory. Paper by Eli Ben-Sasson, Swastik Kopparty & Jaikumar Radhakrishnan, 2006.
Universal Optimality of Dijkstra using Fibonacci Priority Queue with Working Set Property
Oral Qualfier Presentation. Paper by Haeupler, Hladík, Rozhoň, Tarjan, Tětek, 2024. FOCS Best Paper.
$n^{1.62}$ Upper Bound on Hurwitz Problem
TIFR Student Seminar. Paper by Hrubesh, 2024
Super Polynomial Lower Bound on Traveling Salesman Polytope
Course-work presentation (TIFR): Combinatorial Optimization. Paper by Fiorini, Massar, Pokutta, Tiwary and Wolf, 2012
Bounds on Price of Anarchy using Linear and Quadratic Programming
Course-work presentation (TIFR): Algorithmic Game Theory. Paper by Kulkarni and Mirrokni, 2015
Bipartite Matching is in Quasi-NC
TIFR Student Seminar, 2025. Paper by Stephen A. Fenner, Rohit Gurjar and Thomas Thierauf, 2016.
Hensel and Newton Methods in Valuation Rings
Course-work presentation (CMI): Algebra and Computation. Paper by J von zur Gathen, 1984.
Algebraic Geometric Codes
Course-work presentation (CMI): Algorithmic Coding Theory II. Jointly given by Me and Shree Ganesh S J
"Iterated Mod Problem" by Karloff and Ruzzo
Course-work presentation (CMI): Parallel Algorithms and Complexity