| No. | Title | Author | Year |
|---|---|---|---|
| 1 | An Almost Singularly Optimal Asynchronous Distributed MST Algorithm | Dufoulon, Fabien et al. | 2022 |
| 2 | Byzantine Connectivity Testing in the Congested Clique | Augustine, John et al. | 2022 |
| 3 | Singularly Near Optimal Leader Election in Asynchronous Networks | Kutten, Shay et al. | 2021 |
| 4 | Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols | Augustine, John et al. | 2020 |
| 5 | Singularly Optimal Randomized Leader Election | Kutten, Shay et al. | 2020 |
| 6 | Time-Message Trade-Offs in Distributed Algorithms | Gmyr, Robert et al. | 2018 |
| 7 | Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets | Pai, Shreyas et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |