Zahra Parsaeian

Orcid: 0009-0006-3848-1796

According to our database1, Zahra Parsaeian authored at least 10 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the k-Means Problem.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2026

2025
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the <i>k</i>-Means Problem.
CoRR, July, 2025

Towards Round-Optimal Approximate Agreement on Trees.
CoRR, February, 2025

Brief Announcement: Towards Round-Optimal Approximate Agreement on Trees.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

On the Complexity of Distributed Edge Coloring and Orientation Problems.
Proceedings of the 29th International Conference on Principles of Distributed Systems, 2025

2024
Massively Parallel Ruling Set Made Deterministic.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Brief Announcement: Massively Parallel Ruling Set Made Deterministic.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Laminar Matroid Secretary: Greedy Strikes Back.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2022
Towards Sub-Quadratic Diameter Computation in Geometric Intersection Graphs.
Proceedings of the 38th International Symposium on Computational Geometry, 2022


  Loading...