Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Sepehr Assadi, Ran Raz. Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020. pages 342-353, IEEE, 2020. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Polynomial pass lower bounds for graph streaming algorithmsSepehr Assadi, Yu Chen, Sanjeev Khanna. stoc 2019: 265-276 [doi] Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower BoundsSepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang. colt 2022: 4643-4702 [doi] Recent Advances in Multi-Pass Graph Streaming Lower BoundsSepehr Assadi. sigact, 54(3):48-75, September 2023. [doi]
The following publications are possibly variants of this publication: