Amir Azarmehr

According to our database, Amir Azarmehr authored at least 12 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

Single-Pass Streaming CSPs via Two-Tier Sampling.

Amir Azarmehr, Soheil Behnezhad, Shane Ferrante

CoRR, April, 2026

Caterpillar of Thoughts: The Optimal Test-Time Algorithm for Large Language Models.

Amir Azarmehr, Soheil Behnezhad, Alma Ghafari

CoRR, March, 2026

Markov Chains with Rewinding.

Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Madhu Sudan

CoRR, February, 2026

Half-Approximating Maximum Dicut in the Streaming Setting.

Amir Azarmehr, Soheil Behnezhad, Shane Ferrante, Mohammad Saneian

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025

Stochastic Matching via In-n-Out Local Computation Algorithms.

Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Ronitt Rubinfeld

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Massively Parallel Minimum Spanning Tree in General Metric Spaces.

Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance.

Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

Lower Bounds for Non-adaptive Local Computation Algorithms.

Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Madhu Sudan

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

Fully Dynamic Matching: -Approximation in Polylog Update Time.

Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS.

Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time.

Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani

CoRR, 2023

Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation.

Amir Azarmehr, Soheil Behnezhad

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023