Soheil Behnezhad

CS Ph.D. Student, University of Maryland

I am a Ph.D. student at the University of Maryland advised by Prof. Hajiaghayi. Prior to it, I finished my undergraduate studies at the Computer Engineering Department of Sharif University of Technology.

My CV can be found here .

Research Interests
I am interested in algorithms for massive data sets and algorithmic game theory.
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching Manuscript
Semi-MapReduce Meets Congested Clique Manuscript
S. Behnezhad, M. Derakhshan, M. Hajiaghayi
Almost Optimal Stochastic Weighted Matching With Few Queries EC 2018
S. Behnezhad, N. Reyhani
The 19th ACM Conference on Economics and Computation
Spatio-Temporal Games Beyond One Dimension EC 2018
The 19th ACM Conference on Economics and Computation
Brief Announcement: MapReduce Algorithms on Massive Trees ICALP 2018
The 45th International Colloquium on Automata, Languages, and Programming
Winning Strategies of Blotto and Auditing Games SODA 2018
The 29th Annual ACM-SIAM Symposium on Discrete Algorithms
Affinity Clustering: Hierarchical Clustering at Scale NIPS 2017
The 30th Annual Conference on Neural Information Processing Systems
A Polynomial Time Algorithm for Spatio-Temporal Security Games EC 2017
The 18th ACM Conference on Economics and Computation
Brief Announcement: Graph Matching in Massive Datasets SPAA 2017
S. Behnezhad, M. Derakhshan, H. Esfandiari, E. Tan, H. Yami
The 29th ACM Symposium on Parallelism in Algorithms and Architectures
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game AAAI 2017
The 31st AAAI Conference on Artificial Intelligence
Research intern at Upwork, Summer 2017 and Summer 2018
Mentor: Nima Reyhani
Department of Computer Science
University of Maryland
Rm 3264 A.V. Williams Building
College Park, MD USA 20742