Soheil Behnezhad

I am a PhD student at University of Maryland advised by Prof. Hajiaghayi. Prior to it, I finished my undergraduate studies at Sharif University of Technology.

My research interest, broadly speaking, is in the design and analysis of algorithms. Particularly, I am interested in algorithms for processing large-scale graphs in parallel/distributed, streaming, and stochastic settings. I am also interested in algorithmic game theory.

I am a recipient of Google PhD Fellowship 2019.

Recent Manuscripts
Exponentially Faster Massively Parallel Maximal Matching
S. Behnezhad, M. Hajiaghayi, D. Harris
Optimal Strategies of Blotto Games: Beyond Convexity
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching
Publications
Massively Parallel Computation via Remote Memory Access SPAA 2019
The 31st ACM Symposium on Parallelism in Algorithms and Architectures
Stochastic Matching with Few Queries: New Algorithms and Tools SODA 2019
S. Behnezhad, A. Farhadi, M. Hajiaghayi, N. Reyhani
The 30th Annual ACM-SIAM Symposium on Discrete Algorithms
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
Professional Experience
Visiting graduate student at the Simons Institute, UC Berkeley
Spring 2018 and Fall 2018
Research intern at Upwork
Mentor: Nima Reyhani
Summer 2017 and Summer 2018
Contact
Department of Computer Science
University of Maryland
Rm 3264 A.V. Williams Building
College Park, MD USA 20742

soheil@cs.umd.edu