Profiles2023-2026
Sepehr Assadi
University of Waterloo
16Papers
0Last author
19Unique co-authors
16First author
1Solo
First and last author come from byline position, which some venues assign alphabetically.
Recent papers16
- Semi-streaming Matching in a Single Pass: A New Framework for Lower Bounds via BlueprintsAuthor 1 of 3STOC 2026 · 4 citations
- Better Bounds for Semi-Streaming Single-Source Shortest PathsAuthor 1 of 3SODA 2026
- Coloring Graphs with Few Colors in the Streaming ModelAuthor 1 of 3SODA 2026
- Settling the Pass Complexity of Streaming Set CoverAuthor 1 of 2STOC 2026
- Vizing's Theorem in Deterministic Almost-Linear TimeAuthor 1 of 6SODA 2026
- Vizing's Theorem in Near-Linear TimeAuthor 1 of 6STOC 2025 · 12 citations
- Faster Vizing and Near-Vizing Edge Coloring AlgorithmsAuthor 1 of 1SODA 2025 · 6 citations
- Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical AlgorithmsAuthor 1 of 3STOC 2025 · 3 citations
- Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi GraphsAuthor 1 of 3SODA 2025 · 2 citations
- Settling the Pass Complexity of Approximate Matchings in Dynamic Graph StreamsAuthor 1 of 5SODA 2025 · 2 citations
- Distributed Triangle Detection is Hard in Few RoundsAuthor 1 of 2FOCS 2025 · 1 citation
- Streaming and Communication Complexity of Load-Balancing via Matching ContractorsAuthor 1 of 6SODA 2025
- Optimal Multi-pass Lower Bounds for MST in Dynamic StreamsAuthor 1 of 3STOC 2024
- On Regularity Lemma and Barriers in Streaming and Dynamic MatchingAuthor 1 of 4STOC 2023 · 13 citations
- (Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and BeyondAuthor 1 of 2STOC 2023 · 3 citations
- Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate MatchingsAuthor 1 of 3FOCS 2023 · 3 citations
