Alkida Balliu
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Optimal deterministic massively parallel connectivity on forests | 2024-05-14 | Paper |
| Distributed maximal matching and maximal independent set on hypergraphs | 2024-05-14 | Paper |
| Sinkless orientation made simple | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7832759 (Why is no real title available?) (available as arXiv preprint) | 2024-04-15 | Paper |
| Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Node and Edge Averaged Complexities of Local Graph Problems Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Distributed Edge Coloring in Time Polylogarithmic in Δ Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Locally checkable problems in rooted trees Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Locally checkable labelings with small messages (available as arXiv preprint) | 2023-12-08 | Paper |
| Distributed ∆-coloring plays hide-and-seek Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Node and edge averaged complexities of local graph problems Distributed Computing | 2023-11-21 | Paper |
| Classification of distributed binary labeling problems | 2023-11-02 | Paper |
| Locally checkable problems in rooted trees Distributed Computing | 2023-09-11 | Paper |
| A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs | 2023-04-03 | Paper |
| Certification of compact low-stretch routing schemes | 2023-02-03 | Paper |
| Lower Bounds for Maximal Matchings and Maximal Independent Sets Journal of the ACM | 2022-12-08 | Paper |
| Local mending (available as arXiv preprint) | 2022-11-11 | Paper |
| On Pareto optimality in social distance games Artificial Intelligence | 2022-11-08 | Paper |
| Almost global problems in the LOCAL model | 2022-07-21 | Paper |
| Distributed Lower Bounds for Ruling Sets SIAM Journal on Computing | 2022-03-11 | Paper |
| Almost global problems in the LOCAL model Distributed Computing | 2021-09-06 | Paper |
| How much does randomness help with locally checkable problems? Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Brief Announcement: Classification of Distributed Binary Labeling Problems Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Brief Announcement: Classification of Distributed Binary Labeling Problems Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| The Distributed Complexity of Locally Checkable Problems on Paths is Decidable Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Hardness of Minimal Symmetry Breaking in Distributed Computing Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Locality of not-so-weak coloring (available as arXiv preprint) | 2020-03-03 | Paper |
| On non-cooperativeness in social distance games Journal of Artificial Intelligence Research | 2019-11-26 | Paper |
| New classes of distributed time complexity Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| New classes of distributed time complexity Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| What can be verified locally? Journal of Computer and System Sciences | 2018-09-07 | Paper |
| What can be verified locally? | 2018-04-19 | Paper |
| Sparsifying congested cliques and core-periphery networks Structural Information and Communication Complexity | 2016-12-01 | Paper |
Research outcomes over time
This page was built for person: Alkida Balliu
