| Distributed Algorithms for Connectivity and MST in Large Graphs with Efficient Local Computation. | 0 | 0.34 | 2022 |
| An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. | 0 | 0.34 | 2022 |
| Singularly Near Optimal Leader Election in Asynchronous Networks. | 0 | 0.34 | 2021 |
| Almost Optimal Distributed Algorithms for Large-Scale Graph Problems. | 2 | 0.39 | 2015 |
