Soheil Behnezhad
Title
Cited by
Cited by
Year
Affinity clustering: Hierarchical clustering at scale
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, R Kiveris, ...
Proceedings of the 31st International Conference on Neural Information …, 2017
642017
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin
AAAI, 369-375, 2017
392017
Exponentially Faster Massively Parallel Maximal Matching
S Behnezhad, MT Hajiaghayi, DG Harris
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
382019
Semi-MapReduce Meets Congested Clique
S Behnezhad, M Derakhshan, MT Hajiaghayi
arXiv preprint arXiv:1802.10297, 2018
382018
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
36*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
292019
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
262019
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
192021
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
172018
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
142019
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
142018
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
132019
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
122017
Spatio-temporal games beyond one dimension
S Behnezhad, M Derakhshan, M Hajiaghayi, S Seddighin
Proceedings of the 2018 ACM Conference on Economics and Computation, 411-428, 2018
102018
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
9*2020
Brief announcement: Graph matching in massive datasets
S Behnezhad, M Derakhshan, H Esfandiari, E Tan, H Yami
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
92017
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
82019
Massively parallel dynamic programming on trees
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, V Mirrokni
arXiv preprint arXiv:1809.03685, 2018
8*2018
A Polynomial Time Algorithm for Spatio-Temporal Games
S Behnezhad, M Derakhshan, MT Hajiaghayi, A Slivkins
Proceedings of the 2017 ACM Conference on Economics and Computation, 697-714, 2017
82017
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
72020
The system can't perform the operation now. Try again later.
Articles 1–20