| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts | Anagnostides, Ioannis et al. | 2022 |
| 2 | Small Hazard-Free Transducers | Bund, Johannes et al. | 2022 |
| 3 | Low Diameter Graph Decompositions by Approximate Distance Computation | Becker, Ruben et al. | 2020 |
| 4 | Distributed Algorithms for Low Stretch Spanning Trees | Becker, Ruben et al. | 2019 |
| 5 | A Centralized Local Algorithm for the Sparse Spanning Graph Problem | Lenzen, Christoph et al. | 2018 |
| 6 | Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem | Lenzen, Christoph et al. | 2017 |
| 7 | Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models | Becker, Ruben et al. | 2017 |
| 8 | Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus | Lenzen, Christoph et al. | 2017 |
| 9 | Local Algorithms: Self-Stabilization on Speed | Lenzen, Christoph et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |