Janani Sundaresan
PhD Student
Computer Science
University of Waterloo
jsundaresan@uwaterloo.ca
About Me
I am a fourth year PhD student in University of Waterloo CS theory group, advised by Sepehr Assadi. I transferred here from the Rutgers University theory group. I am interested in sublinear and streaming algorithms, online algorithms and more broadly optimization problems.
Previously, I was an undergraduate at IIT Madras where I worked with Jayalal Sarma. I also interned at Microsoft Research under Ravishankar Krishnaswamy.
Publications
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
with Sepehr Assadi, Soheil Behnezhad, Christian Konrad and Kheeran K. Naidu
SODA 2025
O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set
with Sepehr Assadi, Christian Konrad and Kheeran K. Naidu
STOC 2024
Hidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower Bounds for Approximate Matchings
with Sepehr Assadi
FOCS 2023
(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond
with Sepehr Assadi
STOC 2023
Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments
with Varun Gupta, Ravishankar Krishnaswamy and Sai Sandeep
ITCS 2023
On the Computational Power of Programs over BA_2 Monoid
with Manasi S. Kulkarni and Jayalal Sarma
LATA 2021