Mahsa Derakhshan
Mahsa Derakhshan
Verified email at cs.umd.edu
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
412017
Semi-MapReduce Meets Congested Clique
S Behnezhad, M Derakhshan, MT Hajiaghayi
arXiv preprint arXiv:1802.10297, 2018
302018
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
282017
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
232019
Product ranking on online platforms
M Derakhshan, N Golrezaei, V Manshadi, V Mirrokni
Available at SSRN 3130378, 2018
23*2018
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
202019
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
162018
Lp-based approximation for personalized reserve prices
M Derakhshan, N Golrezaei, R Paes Leme
Proceedings of the 2019 ACM Conference on Economics and Computation, 589-589, 2019
122019
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
122018
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
92019
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
82017
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
72018
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
62019
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
62017
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
42019
Massively parallel dynamic programming on trees
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, V Mirrokni
arXiv preprint arXiv:1809.03685, 2018
42018
Brief announcement: Mapreduce algorithms for massive trees
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, V Mirrokni
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
42018
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
32020
Stochastic Weighted Matching: Approximation
S Behnezhad, M Derakhshan
arXiv preprint arXiv:2004.08703, 2020
22020
On distributed hierarchical clustering
M Derakhshan, S Behnezhad, M Bateni, V Mirrokni, MT Hajiaghayi, ...
Advances in Neural Information Processing Systems, 6848-6858, 2017
22017
The system can't perform the operation now. Try again later.
Articles 1–20