Projects per year
Fingerprint
Dive into the research topics where Sepehr Assadi is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Projects
- 1 Active
-
CAREER: Graph Streaming, Communication Games, and the Quest for Optimal Algorithms
Assadi, S. (PI)
3/1/21 → 2/28/26
Project: Research project
-
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs
Assadi, S., Khanna, S. & Kiss, P., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Association for Computing Machinery, p. 2971-2990 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 5).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Simple Sublinear Algorithms for (∆ + 1) Vertex Coloring via Asymmetric Palette Sparsification
Assadi, S. & Yazdanyar, H., 2025, 8th SIAM Symposium on Simplicity of Algorithms, SOSA 2025. Bercea, I.-O. & Pagh, R. (eds.). Society for Industrial and Applied Mathematics Publications, p. 1-8 8 p. (8th SIAM Symposium on Simplicity of Algorithms, SOSA 2025).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Streaming and Communication Complexity of Load-Balancing via Matching Contractors
Assadi, S., Bernstein, A., Langley, Z., Lau, L. C. & Wang, R., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Association for Computing Machinery, p. 3423-3449 27 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 5).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
A Simple (1 − ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
Assadi, S., 2024, 2024 Symposium on Simplicity in Algorithms, SOSA 2024. Parter, M. & Pettie, S. (eds.). Society for Industrial and Applied Mathematics Publications, p. 337-354 18 p. (2024 Symposium on Simplicity in Algorithms, SOSA 2024).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
6 Scopus citations -
O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set
Assadi, S., Konrad, C., Naidu, K. K. & Sundaresan, J., Jun 10 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). Association for Computing Machinery, p. 847-858 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access3 Scopus citations