| No. | Title | Author | Year |
|---|---|---|---|
| 1 | On the Node-Averaged Complexity of Locally Checkable Problems on Trees | Balliu, Alkida et al. | 2023 |
| 2 | Efficient Classification of Locally Checkable Problems in Regular Trees | Balliu, Alkida et al. | 2022 |
| 3 | Exponential Speedup over Locality in MPC with Optimal Memory | Balliu, Alkida et al. | 2022 |
| 4 | Improved Distributed Fractional Coloring Algorithms | Balliu, Alkida et al. | 2022 |
| 5 | Locally Checkable Labelings with Small Messages | Balliu, Alkida et al. | 2021 |
| 6 | Classification of Distributed Binary Labeling Problems | Balliu, Alkida et al. | 2020 |
| 7 | Almost Global Problems in the LOCAL Model | Balliu, Alkida et al. | 2018 |
| 8 | Certification of Compact Low-Stretch Routing Schemes | Balliu, Alkida et al. | 2017 |
| 9 | What Can Be Verified Locally? | Balliu, Alkida et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |