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 |
|---|---|---|
| Drawings of complete multipartite graphs up to triangle flips | 2024-10-16 | Paper |
| Fast distributed Brooks' theorem | 2024-05-14 | Paper |
| Optimal deterministic massively parallel connectivity on forests | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7829268 (Why is no real title available?) (available as arXiv preprint) | 2024-04-09 | Paper |
| Distributed Symmetry Breaking on Power Graphs via Sparsification Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Efficient CONGEST Algorithms for the Lovasz Local Lemma (available as arXiv preprint) | 2023-12-08 | Paper |
| Locally checkable labelings with small messages (available as arXiv preprint) | 2023-12-08 | Paper |
| Efficient randomized distributed coloring in CONGEST Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Classification of distributed binary labeling problems | 2023-11-02 | Paper |
| Local conflict coloring revisited: Linial for lists | 2023-11-02 | Paper |
| Coloring fast without learning your neighbors' colors | 2023-11-02 | Paper |
| Improved distributed degree splitting and edge coloring | 2023-02-03 | Paper |
| Linial for lists Distributed Computing | 2022-12-09 | Paper |
| Noidy conmunixatipn: on the convergence of the averaging population protocol (available as arXiv preprint) | 2022-07-21 | Paper |
| Near-optimal scheduling in the congested clique (available as arXiv preprint) | 2022-03-22 | Paper |
| Greedy routing and the algorithmic small-world phenomenon Journal of Computer and System Sciences | 2022-01-31 | Paper |
| Improved distributed \(\Delta\)-coloring Distributed Computing | 2021-09-06 | Paper |
| Efficient Deterministic Distributed Coloring with Small Bandwidth 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 |
| Distance-2 Coloring in the CONGEST Model Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Distributed Approximation on Power Graphs Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Deterministic distributed dominating set approximation in the CONGEST model Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| On the Complexity of Distributed Splitting Problems Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| P-SLOCAL-Completeness of Maximum Independent Set Approximation Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Improved distributed degree splitting and edge coloring Distributed Computing | 2020-06-15 | Paper |
| Improved distributed degree splitting and edge coloring Distributed Computing | 2020-06-15 | Paper |
| Rumor spreading with bounded in-degree Theoretical Computer Science | 2020-02-06 | Paper |
| Improved distributed delta-coloring Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Deterministic distributed edge-coloring with fewer colors Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Deterministic distributed ruling sets of line graphs (available as arXiv preprint) | 2019-01-30 | Paper |
| Polynomial lower bound for distributed graph coloring in a weak LOCAL model (available as arXiv preprint) | 2018-08-16 | Paper |
| Greedy routing and the algorithmic small-world phenomenon Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| On the complexity of local distributed graph problems Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Rumor spreading with bounded in-degree Lecture Notes in Computer Science | 2016-12-01 | Paper |
| Wavelet Riesz bases associated to nonisotropic dilations | 2015-10-07 | Paper |
Research outcomes over time
This page was built for person: Yannic Maus
