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

Spatio-Temporal Security Games Beyond One Dimension
S. Behnezhad, M. Derakhshan, M.T. Hajiaghayi, S. Seddighin
To appear at EC 2018
Brief Announcement: MapReduce Algorithms on Massive Trees
M.H. Bateni, S. Behnezhad, M. Derakhshan, M.T. Hajiaghayi, V. Mirrokni
To appear at 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
Appeared at SODA 2018
Affinity Clustering: Hierarchical Clustering at Scale
M.H. Bateni, S. Behnezhad, M. Derakhshan, M.T. Hajiaghayi, R. Kiveris, S. Lattanzi, V. Mirrokni
Appeared at NIPS 2017
A Polynomial Time Algorithm for Spatio-Temporal Security Games
S. Behnezhad, M. Derakhshan, M.T. Hajiaghayi, A. Slivkins
Appeared at EC 2017
Brief Announcement: Graph Matching in Massive Datasets
S. Behnezhad, M. Derakhshan, H. Esfandiari, E. Tan, H. Yami
Appeared at SPAA 2017
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
S. S. Behnezhad, S. Dehghani, M. Derakhshan, M.T. Hajiaghayi, S. Seddighin
Appeared at AAAI 2017