Affinity clustering: Hierarchical clustering at scale MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, R Kiveris, ...
Advances in Neural Information Processing Systems 30, 2017
136 2017 Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time S Behnezhad, M Derakhshan, MT Hajiaghayi, C Stein, M Sudan
arXiv preprint arXiv:1909.03478, 2019
71 2019 Exponentially Faster Massively Parallel Maximal Matching S Behnezhad, MT Hajiaghayi, DG Harris
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
67 2019 Massively Parallel Computation of Matching and MIS in Sparse Graphs S Behnezhad, S Brandt, M Derakhshan, M Fischer, MT Hajiaghayi, ...
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
63 * 2019 Faster and Simpler Algorithm for Optimal Strategies of Blotto Game S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin
AAAI, 369-375, 2017
63 2017 Near-Optimal Massively Parallel Graph Connectivity S Behnezhad, L Dhulipala, H Esfandiari, J Lacki, V Mirrokni
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
61 2019 Semi-MapReduce Meets Congested Clique S Behnezhad, M Derakhshan, MT Hajiaghayi
arXiv preprint arXiv:1802.10297, 2018
48 2018 Beating Two-Thirds For Random-Order Streaming Matching S Assadi, S Behnezhad
arXiv preprint arXiv:2102.07011, 2021
44 2021 Massively Parallel Computation via Remote Memory Access S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni, W Schudy
ACM Transactions on Parallel Computing 8 (3), 1-25, 2021
40 2021 Time-Optimal Sublinear Algorithms for Matching and Vertex Cover S Behnezhad
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
37 2022 Fully Dynamic Matching: Beating 2-Approximation in S Behnezhad, J Łącki, V Mirrokni
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
37 2020 Dynamic algorithms for maximum matching size S Behnezhad
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
27 2023 Stochastic Matching with Few Queries: S Behnezhad, M Derakhshan, MT Hajiaghayi
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
26 2020 Streaming and massively parallel algorithms for edge coloring S Behnezhad, M Derakhshan, MT Hajiaghayi, M Knittel, H Saleh
27th Annual European Symposium on Algorithms (ESA 2019), 2019
26 2019 Stochastic Matching with Few Queries: New Algorithms and Tools S Behnezhad, A Farhadi, MT Hajiaghayi, N Reyhani
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
25 2019 Almost 3-approximate correlation clustering in constant rounds S Behnezhad, M Charikar, W Ma, LY Tan
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
24 2022 From battlefields to elections: Winning strategies of blotto and auditing games S Behnezhad, A Blum, M Derakhshan, MT HajiAghayi, M Mahdian, ...
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
24 2018 On regularity lemma and barriers in streaming and dynamic matching S Assadi, S Behnezhad, S Khanna, H Li
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 131-144, 2023
23 2023 New trade-offs for fully dynamic matching via hierarchical EDCS S Behnezhad, S Khanna
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
23 2022 Almost Optimal Stochastic Weighted Matching with Few Queries S Behnezhad, N Reyhani
Proceedings of the 2018 ACM Conference on Economics and Computation, 235-249, 2018
22 2018 
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkVerified email at cs.umd.edu
