| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation | Azarmehr, Amir et al. | 2023 |
| 2 | Beating Two-Thirds For Random-Order Streaming Matching | Assadi, Sepehr et al. | 2021 |
| 3 | On the Robust Communication Complexity of Bipartite Matching | Assadi, Sepehr et al. | 2021 |
| 4 | Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring | Behnezhad, Soheil et al. | 2019 |
| 5 | Streaming and Massively Parallel Algorithms for Edge Coloring | Behnezhad, Soheil et al. | 2019 |
| 6 | Brief Announcement: MapReduce Algorithms for Massive Trees | Bateni, MohammadHossein et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |