Hidden permutations to the rescue: Multi-pass streaming lower bounds for approximate matchings S Assadi, J Sundaresan
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
13 2023 (Noisy) gap cycle counting strikes back: Random order streaming lower bounds for connected components and beyond S Assadi, J Sundaresan
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 183-195, 2023
9 2023 O (log log n) passes is optimal for semi-streaming maximal independent set S Assadi, C Konrad, KK Naidu, J Sundaresan
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 847-858, 2024
7 2024 Look before, before you leap: Online vector load balancing with few reassignments V Gupta, R Krishnaswamy, S Sandeep, J Sundaresan
14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 65 …, 2023
2 2023 Optimal communication complexity of chained index J Sundaresan
arXiv preprint arXiv:2404.07026, 2024
1 2024 Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams S Assadi, S Behnezhad, C Konrad, KK Naidu, J Sundaresan
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
2025 S Assadi, C Konrad, KK Naidu, J Sundaresan
arXiv preprint arXiv:2312.13178, 2023
2023 On the Computational Power of Programs over MS Kulkarni, J Sarma, J Sundaresan
International Conference on Language and Automata Theory and Applications, 29-40, 2021
2021 