| Fully Dynamic Matching:-Approximation in Polylog Update Time A Azarmehr, S Behnezhad, M Roghani Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 13 | 2024 |
| Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation A Azarmehr, S Behnezhad arXiv preprint arXiv:2305.01070, 2023 | 5 | 2023 |
| Massively Parallel Minimum Spanning Tree in General Metric Spaces A Azarmehr, S Behnezhad, R Jayaram, J Łącki, V Mirrokni, P Zhong Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025 | | 2025 |
| Stochastic Matching via In-n-Out Local Computation Algorithms A Azarmehr, S Behnezhad, A Ghafari, R Rubinfeld arXiv preprint arXiv:2411.08805, 2024 | | 2024 |
| Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS A Azarmehr, S Behnezhad, M Roghani Forty-first International Conference on Machine Learning, 0 | | |
Soheil BehnezhadStanford UniversityVerified email at stanford.edu
