On the Computational Power of Programs over BA2 Monoid. - Manasi S. Kulkarni; Jayalal Sarma; Janani Sundaresan (LATA, 2021)

Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings. - Sepehr Assadi; Janani Sundaresan (FOCS, 2023)

Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments. - Varun Gupta 004; Ravishankar Krishnaswamy; Sai Sandeep; Janani Sundaresan (ITCS, 2023)

(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. - Sepehr Assadi; Janani Sundaresan (STOC, 2023)

Hidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower Bounds for Approximate Matchings. - Sepehr Assadi; Janani Sundaresan (CoRR, 2023)

O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. - Sepehr Assadi; Christian Konrad 001; Kheeran K. Naidu; Janani Sundaresan (STOC, 2024)

Optimal Communication Complexity of Chained Index. - Janani Sundaresan (ITCS, 2025)

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. - Sepehr Assadi; Soheil Behnezhad; Christian Konrad 001; Kheeran K. Naidu; Janani Sundaresan (SODA, 2025)

Distributed Triangle Detection is Hard in Few Rounds. - Sepehr Assadi; Janani Sundaresan (CoRR, 2025)

Better Bounds for Semi-Streaming Single-Source Shortest Paths. - Sepehr Assadi; Gary Hoppenworth; Janani Sundaresan (CoRR, 2025)