Scholar
Amir Azarmehr
Google Scholar ID: s6tb-T0AAAAJ
Northeastern University
Citations & Impact
Citations
36
H-index
3
i10-index
1
Publications
6
Co-authors
0
Publications
Resume
Academic Achievements
- Lower Bounds for Non-adaptive Local Computation Algorithms (FOCS '25)
- Tight Pair Query Lower Bounds for Matching and Earth Mover’s Distance (FOCS '25)
- Stochastic Matching via In-n-Out Local Computation Algorithms (STOC '25)
- Massively Parallel Minimum Spanning Tree in General Metric Spaces (SODA '25)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML '24)
- Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time (SODA '24)
- Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation (ICALP '23)
Research Experience
- As a PhD student, involved in multiple research projects with a focus on theoretical computer science, particularly in the area of big-data graph algorithms.
Education
- PhD student in Computer Science at Northeastern University, advised by Soheil Behnezhad; previously received BSc degrees in Computer Science and Math from Sharif University.
Background
- Broadly interested in theoretical computer science, combinatorial optimization, and randomized algorithms. Current research focuses on the theoretical aspects of big-data graph algorithms, which includes graph algorithms in the sublinear, streaming, and dynamic regimes.