Soheil Behnezhad
Soheil Behnezhad
Graduate student, University of Maryland
Email verificata su cs.umd.edu - Home page
TitoloCitata daAnno
Semi-MapReduce Meets Congested Clique
S Behnezhad, M Derakhshan, MT Hajiaghayi
arXiv preprint arXiv:1802.10297, 2018
202018
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin
AAAI, 369-375, 2017
202017
Affinity clustering: Hierarchical clustering at scale
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, R Kiveris, ...
Advances in Neural Information Processing Systems, 6864-6874, 2017
172017
Exponentially Faster Massively Parallel Maximal Matching
S Behnezhad, MT Hajiaghayi, DG Harris
arXiv preprint arXiv:1901.03744, 2019
112019
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
10*2019
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
92017
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
72018
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
72018
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
72017
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
52018
A Polynomial Time Algorithm for Spatio-Temporal Security Games
S Behnezhad, M Derakhshan, MT Hajiaghayi, A Slivkins
Proceedings of the 2017 ACM Conference on Economics and Computation, 697-714, 2017
52017
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
42019
Optimal Strategies of Blotto Games: Beyond Convexity
S Behnezhad, A Blum, M Derakhshan, MT Hajiaghayi, CH Papadimitriou, ...
arXiv preprint arXiv:1901.04153, 2019
32019
Massively Parallel Dynamic Programming on Trees
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, V Mirrokni
arXiv preprint arXiv:1809.03685, 2018
3*2018
Near-optimal massively parallel graph connectivity
S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni
arXiv preprint arXiv:1910.05385, 2019
22019
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
22019
Massively Parallel Computation via Remote Memory Access
S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni, W Schudy
The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 59-68, 2019
22019
Fully Dynamic Matching: Beating 2-Approximation in Update Time
S Behnezhad, J Łącki, V Mirrokni
arXiv preprint arXiv:1911.01839, 2019
2019
Stochastic Matching on Uniformly Sparse Graphs
S Behnezhad, M Derakhshan, A Farhadi, MT Hajiaghayi, N Reyhani
International Symposium on Algorithmic Game Theory, 357-373, 2019
2019
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring
S Behnezhad, M Derakhshan, MT Hajiaghayi, M Knittel, H Saleh
33rd International Symposium on Distributed Computing (DISC 2019), 2019
2019
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20