Amir Azarmehr

Citation: Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Madhu Sudan . (2025). Lower Bounds for Non-adaptive Local Computation Algorithms FOCS, 1488-1511. https://doi.org/10.1109/FOCS63196.2025.00078

Citation: Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein. (2025). Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance FOCS, 2666-2693. https://doi.org/10.1109/FOCS63196.2025.00138

Citation: Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong. (2025). Massively Parallel Minimum Spanning Tree in General Metric Spaces SODA, 143-174. https://doi.org/10.1137/1.9781611978322.5

Citation: Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani. (2024). Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS ICML. https://openreview.net/forum?id=EDEISRmi6X

Citation: Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani. (2024). Fully Dynamic Matching: -Approximation in Polylog Update Time SODA, 3040-3061. https://doi.org/10.1137/1.9781611977912.109