Janani Sundaresan

According to our database, Janani Sundaresan authored at least 8 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams.

Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Optimal Communication Complexity of Chained Index.

Janani Sundaresan

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set.

Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

Hidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower Bounds for Approximate Matchings.

Sepehr Assadi, Janani Sundaresan

CoRR, 2023

(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond.

Sepehr Assadi, Janani Sundaresan

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments.

Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings.

Sepehr Assadi, Janani Sundaresan

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2021

On the Computational Power of Programs over BA₂ Monoid.

Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan

Proceedings of the Language and Automata Theory and Applications, 2021