Janani Sundaresan

18 papers A* 7A 2C 1Journal 8
YearRankTypeTitle / Venue / Authors
2026 A* conf
Better Bounds for Semi-Streaming Single-Source Shortest Paths.
SODA
Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan
2026 A* conf
Coloring Graphs with Few Colors in the Streaming Model.
SODA
Sepehr Assadi, Janani Sundaresan, Helia Yazdanyar
2025 J jnl
Better Bounds for Semi-Streaming Single-Source Shortest Paths.
CoRR
Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan
2025 J jnl
Coloring Graphs with Few Colors in the Streaming Model.
CoRR
Sepehr Assadi, Janani Sundaresan, Helia Yazdanyar
2025 A* conf
Distributed Triangle Detection is Hard in Few Rounds.
FOCS
Sepehr Assadi, Janani Sundaresan
2025 J jnl
Distributed Triangle Detection is Hard in Few Rounds.
CoRR
Sepehr Assadi, Janani Sundaresan
2025 A conf
Optimal Communication Complexity of Chained Index.
ITCS
Janani Sundaresan
2025 A* conf
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams.
SODA
Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan
2024 A* conf
O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set.
STOC
Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan
2024 J jnl
Optimal Communication Complexity of Chained Index.
CoRR
Janani Sundaresan
2024 J jnl
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams.
CoRR
Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan
2023 A* conf
(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond.
STOC
Sepehr Assadi, Janani Sundaresan
2023 J jnl
(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond.
CoRR
Sepehr Assadi, Janani Sundaresan
2023 J jnl
Hidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower Bounds for Approximate Matchings.
CoRR
Sepehr Assadi, Janani Sundaresan
2023 A* conf
Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings.
FOCS
Sepehr Assadi, Janani Sundaresan
2023 A conf
Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments.
ITCS
Varun Gupta, Ravishankar Krishnaswamy, Sai Sandeep, Janani Sundaresan
2023 J jnl
O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set.
CoRR
Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan
2021 C conf
On the Computational Power of Programs over BA
LATA
Manasi S. Kulkarni, Jayalal Sarma, Janani Sundaresan