Research Intrests

My research is split into two main areas, big data algorithms, and algorithmic game theory. My research in big data is specifically focused on designing distributed and streaming algorithms for large-scale graph problems.

Publications

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time
S. Behnezhad , M. Derakhshan, M.T. Hajiaghayi, C. Stein , M.Sudan
60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019)
LP-based Approximation for Personalized Reserve Prices
M. Derakhshan, N. Golrezaei , R. Paes Leme
The 20th ACM Conference on Economics and Computation (EC 2019)
Optimal Strategies of Blotto Games: Beyond Convexity
S. Behnezhad , A. Blum , M. Derakhshan, M.T. Hajiaghayi , C. Papadimitriou , S. Seddighin
The 20th ACM Conference on Economics and Computation (EC 2019)
Massively Parallel Computation of Matching and MIS in Sparse Graphs
S. Behnezhad S. Brandt, M. Derakhshan, M. Fischer, M. Hajiaghayi, R. Karp, J. Uitto
The 38th ACM Symposium on Principles of Distributed Computing (PODC 2019)
Spatio-Temporal Security Games Beyond One Dimension
S. Behnezhad , M. Derakhshan, M.T. Hajiaghayi , S. Seddighin
The 19th ACM Conference on Economics and Computation (EC 2018)
Brief Announcement: MapReduce Algorithms on Massive Trees
M.H. Bateni , S. Behnezhad , M. Derakhshan, M.T. Hajiaghayi , V. Mirrokni
The 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Winning Strategies of Blotto and Auditing Games
S. Behnezhad , A. Blum , M. Derakhshan, M.T. Hajiaghayi , M. Mahdian , C. Papadimitriou , R. Rivest , S. Seddighin , P. Stark
The 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018)
Affinity Clustering: Hierarchical Clustering at Scale
M.H. Bateni , S. Behnezhad , M.T. Hajiaghayi , R. Kiveris, S. Lattanzi , V. Mirrokni
The 31th Annual Conference on Neural Information Processing Systems (NIPS 2017)
A Polynomial Time Algorithm for Spatio-Temporal Security Games
S. Behnezhad , M. Derakhshan, M.T. Hajiaghayi , A. Slivkins
The 18th ACM Conference on Economics and Computation (EC 2017)
Brief Announcement: Graph Matching in Massive Datasets
S. Behnezhad , M. Derakhshan, H. Esfandiari , E. Tan, H. Yami
The 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2017)
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
S. Behnezhad , S. Dehghani , M. Derakhshan, M.T. Hajiaghayi , S. Seddighin
The 31st AAAI Conference on Artificial Intelligence (AAAI 2017)