Azarmehr, Amir

1. Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation
   2023/05/01 by Azarmehr, Amir, Behnezhad, Soheil · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. Massively Parallel Minimum Spanning Tree in General Metric Spaces
   2024/08/12 by Azarmehr, Amir, Behnezhad, Soheil, Jayaram, Rajesh +3 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Stochastic Matching via In-n-Out Local Computation Algorithms
   2024/11/13 by Amir Azarmehr, Soheil Behnezhad, Azarmehr, Amir +5 · 1 citation
   Computer Science · #Algorithms and Data Compression #Data Management and Algorithms #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms
4. Fully Dynamic Matching: (2-√(2))-Approximation in Polylog Update Time
   2023/07/17 by Amir Azarmehr, Soheil Behnezhad, Azarmehr, Amir +3 · 1 citation
   Computer Science · #Caching and Content Delivery #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed systems and fault tolerance #FOS: Computer and information sciences