About Me

I am a third-year PhD student in the Theory of Computation Group at MIT, where I am extremely fortunate to be advised by Yael Tauman Kalai.

Before this, I did my BSc.(Hons) in Mathematics and Computer Science from Chennai Mathematical Institute. During my undergrad, I was lucky enough to be advised by Prahladh Harsha and Mrinal Kumar. I also spent summer 2024 in at IRIF Paris working under David Saulpic on clustering algorithms. I spent an incredible summer 2026 interning with Guy Rothblum at Apple’s New York offices working on verification tasks related to machine learning.

Research Interests

My main interest is in error correction, proof systems, and more generally theoretical CS. I tend to enjoy most problems with flavours of combinatorics, algebra and randomization.

Selected Representative Publications:

• Explicit Reed-Solomon Subspace Designs: Optimal List and Line Decoding
  with Omar Alrabiah and Venkatesan Guruswami
  [ECCC] [arXiv]

• The Dimension of Verifying Machine Learning
  with Guy Rothblum

• Optimal Proximity Gaps for Subspace-Design Codes and (Random) Reed-Solomon Codes
  with Venkatesan Guruswami.
  STOC 2026, Salt Lake City [ECCC] [ePrint] [Ethproofs call talk by Venkat] [Talk at TIFR]

• Efficiently Batching Unambiguous Interactive Proofs
  with Bonnie Berger, Matthew Hong, and Yael Kalai.
  FOCS 2025, Sydney [ECCC] [arXiv] [FOCS Video by Matt]

Subspace Designs: A Universal Tool for Derandomization

FOCS 2026 Workshop
Co-organized with Joshua Brakensiek and Venkatesan Guruswami.

Teaching (MIT):

Fall 2026:

• 6.S953: Topics in Error-Correcting Codes for Computer Science
  with Yael Tauman Kalai

TAing at CMI:

Discrete Math: Spring 2023, 2024,
Complexity Theory 1: Spring 2023,
Theory of Computation: Fall 2022

All Publications:

All authors are in alphabetical order of last name.

Preprints

• The Dimension of Verifying Machine Learning
  with Guy Rothblum

• Explicit Subspace Evasive Sets via Subspace Designs
  with Joshua Brakensiek, Yeyuan Chen, Mahdi Cheraghchi, Venkatesan Guruswami, Aaron (Louie) Putterman, and Zihan Zhang

• Combinatorial limitations of list-decoding Reed-Solomon codes
  with Omar Alrabiah and Venkatesan Guruswami
  [ECCC] [arXiv]

• Explicit Reed-Solomon Subspace Designs: Optimal List and Line Decoding
  with Omar Alrabiah and Venkatesan Guruswami
  [ECCC] [arXiv]

• Improved LCL Equivalences and Curve Decoding Alphabet Sizes
  with Venkatesan Guruswami, Yihang (Kimi) Sun and Mary Wootters
  [arXiv]

• Improved analysis of list-decodability of random linear codes: It’s all about counting constraints
  with Venkatesan Guruswami
  [ECCC]

2027

• Unshardable Codes
  with Prashanth Amireddy, Yevgeniy Dodis, Ethan Mook, Madhu Sudan, and Daniel Wichs.
  ITCS 2027, Berkeley

• Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
  with Venkatesan Guruswami.
  ITCS 2027, Berkeley [ECCC] [arXiv]

2026

• Exponentially improved explicit lossless rank dispersers over small fields
  with Venkatesan Guruswami.
  FSTTCS 2026, New Delhi

• Explicit Constant-Alphabet Subspace Design Codes
  with Venkatesan Guruswami and Jun-Ting (Tim) Hsieh.
  FOCS 2026, New York [ECCC] [arXiv]

• Locality of Curve Decoding and Improved Proximity Gaps
  with Venkatesan Guruswami, Yihang (Kimi) Sun and Mary Wootters.
  RANDOM 2026, Boston [arXiv]

• Fast list-recovery of univariate multiplicity and folded Reed-Solomon codes
  with Prahladh Harsha, Mrinal Kumar, and Ashutosh Shankar.
  RANDOM 2026, Boston [ECCC] [arXiv]

• Optimal Proximity Gaps for Subspace-Design Codes and (Random) Reed-Solomon Codes
  with Venkatesan Guruswami.
  STOC 2026, Salt Lake City [ECCC] [ePrint] [Ethproofs call talk by Venkat] [Talk at TIFR]

2025

• Efficiently Batching Unambiguous Interactive Proofs
  with Bonnie Berger, Matthew Hong, and Yael Kalai.
  FOCS 2025, Sydney [ECCC] [arXiv] [FOCS Video by Matt]

2024

• Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes
  with Prahladh Harsha, Mrinal Kumar, and Ashutosh Shankar.
  FOCS 2024, Chicago [ECCC] [arXiv] [Simons Talk by Prahladh]

Service:

Subreviewed for CCC, FOCS, ITCS, RANDOM, SODA, STOC, and ACM Transcations on Algorithms.

Olympiad and Outreach

• Indian Mathematical Olympiads: I am currently also quite involved with Mathematical Olympiads in India. I help with team training for IMO and EGMO, problem selection, problem proposing and organizing selection camps from the national stage. If you wish to help or support the EGMO program in India, proposing or teaching, please feel free to reach out!

• Outreach: I am also interested in understanding and improving school education in India especially in Mathematics and Computer Science. I want to understand how logical reasoning, puzzle solving and other aspects of problem solving can be inculcated into students at the grassroots level. I am also interested in increasing opportunities, awareness and recogonition for students who demonstrate extraordinary interest or capability in STEM fields.

I would be extremely interested in any opportunities to work on more grassroots’ level for Mathematics education, Computational and Logical Thinking, Problem Solving etc. If you have any such opportunities where my experience would be useful, please feel free to reach out. For a list of activities I have been involved in, please reach out to me via email.

Talks and Honors:

Please check my cv.

– Website updated November 2026

Powered by Jekyll and Minimal Light theme.