| No. |
Title |
Author |
Year |
| 1 |
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond |
Ghaffari, Mohsen et al. |
2020 |
| 2 |
Distributed Algorithms for Low Stretch Spanning Trees |
Becker, Ruben et al. |
2019 |
| 3 |
Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication |
Ghaffari, Mohsen et al. |
2019 |
| 4 |
Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond |
Ghaffari, Mohsen et al. |
2019 |
| 5 |
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics |
Fischer, Manuela et al. |
2018 |
| 6 |
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors |
Clementi, Andrea et al. |
2018 |
| 7 |
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set |
Ghaffari, Mohsen et al. |
2018 |
| 8 |
Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping |
Ghaffari, Mohsen et al. |
2018 |
| 9 |
Distributed Set Cover Approximation: Primal-Dual with Optimal Locality |
Even, Guy et al. |
2018 |
| 10 |
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms |
Ghaffari, Mohsen et al. |
2018 |
| 11 |
Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching |
Ghaffari, Mohsen et al. |
2018 |
| 12 |
Improved Distributed Degree Splitting and Edge Coloring |
Ghaffari, Mohsen et al. |
2017 |
| 13 |
Near-Optimal Distributed DFS in Planar Graphs |
Ghaffari, Mohsen et al. |
2017 |
| 14 |
Simple and Near-Optimal Distributed Coloring for Sparse Graphs |
Ghaffari, Mohsen et al. |
2017 |
| 15 |
Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy |
Fischer, Manuela et al. |
2017 |
| 16 |
Leader Election in Unreliable Radio Networks |
Ghaffari, Mohsen et al. |
2016 |
