Sledovat
Soheil Behnezhad
Název
Citace
Citace
Rok
Affinity clustering: Hierarchical clustering at scale
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, R Kiveris, ...
Advances in Neural Information Processing Systems 30, 2017
1192017
Exponentially Faster Massively Parallel Maximal Matching
S Behnezhad, MT Hajiaghayi, DG Harris
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
602019
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
57*2019
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
562019
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
542019
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin
AAAI, 369-375, 2017
542017
Semi-MapReduce Meets Congested Clique
S Behnezhad, M Derakhshan, MT Hajiaghayi
arXiv preprint arXiv:1802.10297, 2018
462018
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
372021
Beating Two-Thirds For Random-Order Streaming Matching
S Assadi, S Behnezhad
arXiv preprint arXiv:2102.07011, 2021
372021
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
332020
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
S Behnezhad
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
272022
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
232020
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
232018
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
222019
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
212018
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
182019
A pilot deployment of an online tool for large-scale virtual auditing of urban accessibility
M Saha, K Hara, S Behnezhad, A Li, M Saugstad, H Maddali, S Chen, ...
Proceedings of the 19th International ACM SIGACCESS Conference on Computers …, 2017
182017
Dynamic algorithms for maximum matching size
S Behnezhad
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
172023
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
H Esfandiari, J Łącki, L Dhulipala, S Behnezhad, V Mirrokni, WJ Schudy
16*2020
Optimal strategies of blotto games: Beyond convexity
S Behnezhad, A Blum, M Derakhshan, MT Hajiaghayi, CH Papadimitriou, ...
Proceedings of the 2019 ACM Conference on Economics and Computation, 597-616, 2019
162019
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20