I am a fifth-year PhD student at the University of Waterloo in the Algorithms & Complexity Group within the Cheriton School of Computer Science. I am incredibly fortunate to be advised by Sepehr Assadi. Before this, I spent three wonderful years at Rutgers University in the theory group of the CS Department. Prior to this, I was a Computer Science major at Rutgers Camden for one year, where I was mentored by Rajiv Gandhi. I completed three years of my bachelor's in Computer Science Engineering at Mahindra École Centrale before transferring to Rutgers Camden.
My research interest is in Theoretical Computer Science and specifically in Streaming Algorithms. I have recently also worked on Sublinear, Dynamic, and Learning-Augmented algorithms. I generally enjoy working on Graph problems in these settings.
Publications
-
An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs
PODS 2025
with Sepehr Assadi
[arXiv] [conf]
-
Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
AISTATS 2025
with Vladimir Braverman , Prathamesh Dharangutte , Shreyas Pai , and Chen Wang
[arXiv] [conf]
-
Space Complexity of Minimum Cut Problems in Single-Pass Streams
ITCS 2025
with Matthew Ding , Alexandro Garces , Jason Li , Honghao Lin , Jelani Nelson , and David P. Woodruff
[arXiv] [conf]
-
Learning-augmented Maximum Independent Set
APPROX 2024
with Vladimir Braverman , Prathamesh Dharangutte , and Chen Wang
[arXiv] [conf]
-
New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification
ITCS 2024
with Prantar Ghosh
[arXiv] [conf]
-
Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost
NeurIPS 2023
with Sepehr Assadi and Chen Wang
[arXiv] [conf]
-
Tight Bounds for Vertex Connectivity in Dynamic Streams
SOSA 2023
with Sepehr Assadi
[arXiv] [conf]
-
Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs
ICDT 2023
with Sepehr Assadi , Nirmit Joshi , and Milind Prabhu
[arXiv] [conf]
-
Space Optimal Vertex Cover in Dynamic Streams
APPROX 2022
with Kheeran K. Naidu
[arXiv] [conf]
-
An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams
ITCS 2022
with Sepehr Assadi
[arXiv] [conf]
Talks
- Young Researcher Seminar Series, Toyota Technological Institute at Chicago (April 2025)
- Seminar Talk, University of Waterloo (March 2025)
- Seminar Talk, Dartmouth College (January 2025)
- Reading Group Presentation, Rutgers University (June 2024)
Service
Teaching
-
Research Experiences for Undergraduates (REU) Mentor
(Summer 2023)
Rutgers University / DIMACS
Along with my advisor Sepehr Assadi. -
Directed Reading Program (DRP) Mentor for Women in Mathematics (WiM)
(Winter 2024)
University of Waterloo -
Guest Lecture in Randomized Algorithms (CS 761)
(Winter 2025)
University of Waterloo -
Guest Lectures on Sublinear and Streaming Algorithms
(Summer 2020–2024)
Program in Algorithmic and Combinatorial Thinking (PACT), Princeton University -
Teaching Assistant for Design and Analysis of Computer Algorithms (CS 344)
(Spring 2021, Spring 2022, Fall 2021)
Rutgers University -
Teaching Assistant for Introduction to Discrete Structures (CS 205)
(Fall 2020, Summer 2021)
Rutgers University -
Teaching Assistant for Discrete Mathematics
(Summer 2019)
Program in Algorithmic and Combinatorial Thinking (PACT), Princeton University
External Reviews
- Symposium on Theory of Computing (STOC): 2022, 2024, 2025
- Symposium on Foundations of Computer Science (FOCS): 2025
- Symposium on Discrete Algorithms (SODA): 2022, 2023, 2024
- Innovations in Theoretical Computer Science (ITCS): 2024, 2025
- Symposium on Principles of Database Systems (PODS): 2025
- European Symposium on Algorithms (ESA): 2022, 2023, 2024
- International Colloquium on Automata, Languages, and Programming (ICALP): 2023, 2025
- Symposium on Principles of Distributed Computing (PODC): 2021