I am a third year Ph.D. student of the Department of Computer Science at Dartmouth College. I am advised by Prof. Deeparnab Chakrabarty. My interests lie broadly in Theoretical Computer Science, especially in algorithm design. My current projects seek to develop approximation algorithms for certain clustering problems and covering problems. Generally, I enjoy thinking about algorithms and mathematical structures related to optimization problems, especially those that arise from operations research, social issues, and puzzles.
Before Dartmouth, I spent five enriching years at Chennai Mathematical Institute, India, where I earned an M.Sc. in Computer Science in 2020 and a B.Sc. in Mathematics and Computer Science in 2018. My Master's thesis, Popular Matchings under Lower Quotas and their relationship to Stability under Classifications, was supervised by Prof. Prajakta Nimbhorkar.
Surveys and Reports
October 03. Observing a graduate workers' contract bargaining session.
September 26. Speaking remotely at the UMass Amherst Theory Seminar.
May 12. Visiting and giving a talk at TTI Chicago. [slides]
Spring quarter. Working as TA for COSC 34/234: Randomized Algorithms taught by Prof. Deeparnab Chakrabarty.
December 19. Giving a talk at ISI Kolkata.
December 11-14. Visiting CMI, and giving a talk on December 13.
I have worked as Head TA for:
I have also worked as TA for: