Yannic Maus

ACM Trans. Parallel Comput., December, 2023

Conditionally Optimal Parallel Coloring of Forests.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Adaptive Massively Parallel Connectivity in Optimal Space.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Fast Dynamic Programming in Trees in the MPC Model.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Fast Distributed Brooks' Theorem.

[BibT_eX]

[DOI]

Manuela Fischer

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Optimal Deterministic Massively Parallel Connectivity on Forests.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Distributed Symmetry Breaking on Power Graphs via Sparsification.

[BibT_eX]

[DOI]

Saku Peltonen

Jara Uitto

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Drawings of Complete Multipartite Graphs up to Triangle Flips.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Greedy routing and the algorithmic small-world phenomenon.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Linial for lists.

[BibT_eX]

[DOI]

Tigran Tonoyan

Distributed Comput., 2022

Fast Distributed Vertex Splitting with Applications.

[BibT_eX]

[DOI]

Alexandre Nolin

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Exponential Speedup over Locality in MPC with Optimal Memory.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Distributed Vertex Cover Reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Improved distributed Δ-coloring.

[BibT_eX]

[DOI]

Distributed Comput., 2021

Efficient CONGEST Algorithms for the Lovász Local Lemma.

[BibT_eX]

[DOI]

Jara Uitto

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Locally Checkable Labelings with Small Messages.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Efficient randomized distributed coloring in CONGEST.

[BibT_eX]

[DOI]

Tigran Tonoyan

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Near-Optimal Scheduling in the Congested Clique.

[BibT_eX]

[DOI]

Keren Censor-Hillel

Volodymyr Polosukhin

Proceedings of the Structural Information and Communication Complexity, 2021

2020

Rumor spreading with bounded in-degree.

[BibT_eX]

[DOI]

Sebastian Daum

Theor. Comput. Sci., 2020

The power of locality: Exploring the limits of randomness in distributed computing.

[BibT_eX]

[DOI]

it Inf. Technol., 2020

Improved distributed degree splitting and edge coloring.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Local Conflict Coloring Revisited: Linial for Lists.

[BibT_eX]

[DOI]

Tigran Tonoyan

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Coloring Fast Without Learning Your Neighbors' Colors.

[BibT_eX]

[DOI]

Alexandre Nolin

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Classification of Distributed Binary Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Distance-2 Coloring in the CONGEST Model.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Distributed Approximation on Power Graphs.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Efficient Deterministic Distributed Coloring with Small Bandwidth.

[BibT_eX]

[DOI]

Philipp Bamberger

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Brief Announcement: Classification of Distributed Binary Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

P-SLOCAL-Completeness of Maximum Independent Set Approximation.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Deterministic Distributed Dominating Set Approximation in the CONGEST Model.

[BibT_eX]

[DOI]

Janosch Deurer

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma.

[BibT_eX]

[DOI]

Sebastian Brandt

Jara Uitto

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

On the Complexity of Distributed Splitting Problems.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Local Distributed Algorithms in Highly Dynamic Networks.

[BibT_eX]

[DOI]

Philipp Bamberger

Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol.

[BibT_eX]

[DOI]

Frederik Mallmann-Trenn

Dominik Pajak

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

The power of locality: exploring the limits of randomness in distributed computing.

[BibT_eX]

[DOI]

PhD thesis, 2018

Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks.

[BibT_eX]

[DOI]

Philipp Bamberger

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Deterministic distributed edge-coloring with fewer colors.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Deterministic Distributed Ruling Sets of Line Graphs.

[BibT_eX]

[DOI]

Simon Weidner

Proceedings of the Structural Information and Communication Complexity, 2018

Improved Distributed Delta-Coloring.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

DISC 2017 Review.

[BibT_eX]

[DOI]

Manuela Fischer

SIGACT News, 2017

On the complexity of local distributed graph problems.

[BibT_eX]

[DOI]

Mohsen Ghaffari