Follow
Mahsa Derakhshan
Mahsa Derakhshan
Northeastern University
Verified email at northeastern.edu - Homepage
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
Product ranking on online platforms
M Derakhshan, N Golrezaei, V Manshadi, V Mirrokni
Management Science 68 (6), 4024-4041, 2022
87*2022
Fully dynamic maximal independent set with polylogarithmic update time
S Behnezhad, M Derakhshan, MT Hajiaghayi, C Stein, M Sudan
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
702019
Faster and simpler algorithm for optimal strategies of Blotto game
S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
622017
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
492019
Semi-mapreduce meets congested clique
S Behnezhad, M Derakhshan, MT Hajiaghayi
arXiv preprint arXiv:1802.10297, 2018
452018
Stochastic matching with few queries:(1-ε) approximation
S Behnezhad, M Derakhshan, MT Hajiaghayi
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
262020
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
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
Massively parallel symmetry breaking on sparse graphs: MIS and maximal matching
S Behnezhad, M Derakhshan, MT Hajiaghayi, RM Karp
arXiv preprint arXiv:1807.06701, 2018
212018
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
202019
Lp-based approximation for personalized reserve prices
M Derakhshan, N Golrezaei, RP Leme
arXiv preprint arXiv:1905.01526, 2019
202019
Max-weight online stochastic matching: Improved approximations against the online benchmark
M Braverman, M Derakhshan, A Molina Lovett
Proceedings of the 23rd ACM Conference on Economics and Computation, 967-985, 2022
182022
Linear program-based approximation for personalized reserve prices
M Derakhshan, N Golrezaei, R Paes Leme
Management Science 68 (3), 1849-1864, 2022
142022
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
122018
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
122017
Stochastic Weighted Matching:(1-ϵ) Approximation
S Behnezhad, M Derakhshan
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
112020
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
102019
Beating greedy for approximating reserve prices in multi-unit vcg auctions
M Derakhshan, DM Pennock, A Slivkins
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
92021
Massively parallel dynamic programming on trees
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, V Mirrokni
arXiv preprint arXiv:1809.03685, 2018
92018
The system can't perform the operation now. Try again later.
Articles 1–20