Artigos com autorizações de acesso público - Mahsa DerakhshanSaiba mais
16 artigos disponíveis publicamente
Affinity clustering: Hierarchical clustering at scale
MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, R Kiveris, ...
Advances in Neural Information Processing Systems 30, 2017
Autorizações: US National Science Foundation, US Department of Defense
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
Autorizações: US National Science Foundation
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
Autorizações: US National Science Foundation, US Department of Defense
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
Autorizações: US National Science Foundation, US Department of Defense, European Commission
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
Autorizações: US National Science Foundation, US Department of Defense
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
Autorizações: US National Science Foundation
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
Autorizações: US National Science Foundation, US Department of Defense
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
Autorizações: US National Science Foundation, US Department of Defense
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
Autorizações: US National Science Foundation, US Department of Defense
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
Autorizações: US National Science Foundation, US Department of Defense
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
Autorizações: US National Science Foundation, US Department of Defense
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
Autorizações: US National Science Foundation, US Department of Defense
Fast and simple solutions of Blotto games
S Behnezhad, S Dehghani, M Derakhshan, M Hajiaghayi, S Seddighin
Operations Research 71 (2), 506-516, 2023
Autorizações: US National Science Foundation, US Department of Defense
Stochastic vertex cover with few queries
S Behnezhad, A Blum, M Derakhshan
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
Autorizações: US National Science Foundation
Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation
M Derakhshan, N Durvasula, N Haghtalab
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 242-253, 2023
Autorizações: US National Science Foundation
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
Autorizações: US National Science Foundation, US Department of Defense
As informações de publicação e financiamento são determinadas automaticamente por um programa de computador