| 2026 | SODA | Better Bounds for Semi-Streaming Single-Source Shortest Paths. | Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan |
| 2026 | SODA | Coloring Graphs with Few Colors in the Streaming Model. | Sepehr Assadi, Janani Sundaresan, Helia Yazdanyar |
| 2026 | STOC | Settling the Pass Complexity of Streaming Set Cover. | Sepehr Assadi, Janani Sundaresan |
| 2025 | FOCS | Distributed Triangle Detection is Hard in Few Rounds. | Sepehr Assadi, Janani Sundaresan |
| 2025 | SODA | Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. | Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan |
| 2024 | STOC | O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. | Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan |
| 2023 | FOCS | Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings. | Sepehr Assadi, Janani Sundaresan |
| 2023 | STOC | (Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. | Sepehr Assadi, Janani Sundaresan |
| 2021 | LATA | On the Computational Power of Programs over BA | Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan |