Lune

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

  1. Semi-streaming Matching in a Single Pass: A New Framework for Lower Bounds via BlueprintsAuthor 1 of 3STOC 2026 · 4 citations
  2. Better Bounds for Semi-Streaming Single-Source Shortest PathsAuthor 1 of 3SODA 2026
  3. Coloring Graphs with Few Colors in the Streaming ModelAuthor 1 of 3SODA 2026
  4. Settling the Pass Complexity of Streaming Set CoverAuthor 1 of 2STOC 2026
  5. Vizing's Theorem in Deterministic Almost-Linear TimeAuthor 1 of 6SODA 2026
  6. Vizing's Theorem in Near-Linear TimeAuthor 1 of 6STOC 2025 · 12 citations
  7. Faster Vizing and Near-Vizing Edge Coloring AlgorithmsAuthor 1 of 1SODA 2025 · 6 citations
  8. Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical AlgorithmsAuthor 1 of 3STOC 2025 · 3 citations
  9. Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi GraphsAuthor 1 of 3SODA 2025 · 2 citations
  10. Settling the Pass Complexity of Approximate Matchings in Dynamic Graph StreamsAuthor 1 of 5SODA 2025 · 2 citations
  11. Distributed Triangle Detection is Hard in Few RoundsAuthor 1 of 2FOCS 2025 · 1 citation
  12. Streaming and Communication Complexity of Load-Balancing via Matching ContractorsAuthor 1 of 6SODA 2025
  13. Optimal Multi-pass Lower Bounds for MST in Dynamic StreamsAuthor 1 of 3STOC 2024
  14. On Regularity Lemma and Barriers in Streaming and Dynamic MatchingAuthor 1 of 4STOC 2023 · 13 citations
  15. (Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and BeyondAuthor 1 of 2STOC 2023 · 3 citations
  16. Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate MatchingsAuthor 1 of 3FOCS 2023 · 3 citations
Dusk over the sea between two cliffs drawn in fine vertical lines