Follow
Soheil Behnezhad
Title
Cited by
Cited by
Year
Affinity clustering: Hierarchical clustering at scale
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, R Kiveris, ...
Advances in Neural Information Processing Systems 30, 2017
1292017
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
702019
Exponentially Faster Massively Parallel Maximal Matching
S Behnezhad, MT Hajiaghayi, DG Harris
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
642019
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
62*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
622017
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
592019
Semi-MapReduce Meets Congested Clique
S Behnezhad, M Derakhshan, MT Hajiaghayi
arXiv preprint arXiv:1802.10297, 2018
472018
Beating Two-Thirds For Random-Order Streaming Matching
S Assadi, S Behnezhad
arXiv preprint arXiv:2102.07011, 2021
422021
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
392021
Fully Dynamic Matching: Beating 2-Approximation in Update Time
S Behnezhad, J Łącki, V Mirrokni
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
372020
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
S Behnezhad
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
362022
Dynamic algorithms for maximum matching size
S Behnezhad
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
262023
Stochastic Matching with Few Queries: Approximation
S Behnezhad, M Derakhshan, MT Hajiaghayi
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
262020
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
242022
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
242019
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
242019
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
232022
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
232018
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
222018
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
212023
The system can't perform the operation now. Try again later.
Articles 1–20