Recent Advances in Multi-Pass Graph Streaming Lower Bounds - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Sepehr Assadi. Recent Advances in Multi-Pass Graph Streaming Lower Bounds. SIGACT News, 54(3):48-75, September 2023. [doi]

The 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]

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other ProblemsSepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu. focs 2020: 354-364 [doi]

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming AlgorithmsSepehr Assadi, Ran Raz. focs 2020: 342-353 [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]

Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate MatchingsSepehr Assadi, Janani Sundaresan. focs 2023: 909-932 [doi]

Optimal Multi-Pass Lower Bounds for MST in Dynamic StreamsSepehr Assadi, Gillat Kol, Zhijun Zhang 0007. eccc, TR23, 2023. [doi]

runs on WebDSL