| Affinity clustering: Hierarchical clustering at scale MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, R Kiveris, ... Proceedings of the 31st International Conference on Neural Information …, 2017 | 43 | 2017 |
| Exponentially Faster Massively Parallel Maximal Matching S Behnezhad, MT Hajiaghayi, DG Harris 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 33 | 2019 |
| 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 | 31* | 2019 |
| Semi-MapReduce Meets Congested Clique S Behnezhad, M Derakhshan, MT Hajiaghayi arXiv preprint arXiv:1802.10297, 2018 | 30 | 2018 |
| Faster and Simpler Algorithm for Optimal Strategies of Blotto Game S Behnezhad, S Dehghani, M Derakhshan, MT HajiAghayi, S Seddighin AAAI, 369-375, 2017 | 28 | 2017 |
| Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time S Behnezhad, M Derakhshan, MT Hajiaghayi, C Stein, M Sudan arXiv preprint arXiv:1909.03478, 2019 | 23 | 2019 |
| Near-optimal massively parallel graph connectivity S Behnezhad, L Dhulipala, H Esfandiari, J Lacki, V Mirrokni 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 17 | 2019 |
| Almost Optimal Stochastic Weighted Matching with Few Queries S Behnezhad, N Reyhani Proceedings of the 2018 ACM Conference on Economics and Computation, 235-249, 2018 | 14 | 2018 |
| Massively parallel computation via remote memory access S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni, W Schudy The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 59-68, 2019 | 12 | 2019 |
| 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 | 12 | 2018 |
| A pilot deployment of an online tool for large-scale virtual auditing of urban accessibility M Saha, K Hara, S Behnezhad, A Li, M Saugstad, H Maddali, S Chen, ... Proceedings of the 19th International ACM SIGACCESS Conference on Computers …, 2017 | 11 | 2017 |
| Stochastic Matching with Few Queries: New Algorithms and Tools S Behnezhad, A Farhadi, MT Hajiaghayi, N Reyhani Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 10 | 2019 |
| 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 | 9 | 2019 |
| 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 | 8 | 2017 |
| Massively parallel dynamic programming on trees MH Bateni, S Behnezhad, M Derakhshan, MT Hajiaghayi, V Mirrokni arXiv preprint arXiv:1809.03685, 2018 | 7* | 2018 |
| 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 | 7 | 2018 |
| 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 | 6 | 2019 |
| 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 | 6 | 2017 |
| Stochastic Matching on Uniformly Sparse Graphs S Behnezhad, M Derakhshan, A Farhadi, MT Hajiaghayi, N Reyhani International Symposium on Algorithmic Game Theory, 357-373, 2019 | 4 | 2019 |
| Stochastic matching with few queries:(1-ε) approximation S Behnezhad, M Derakhshan, MT Hajiaghayi Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 3 | 2020 |
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkVerified email at cs.umd.edu
