| No. |
Title |
Author |
Year |
| 1 |
Exponential Speedup over Locality in MPC with Optimal Memory |
Balliu, Alkida et al. |
2022 |
| 2 |
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees |
Brandt, Sebastian et al. |
2021 |
| 3 |
Efficient CONGEST Algorithms for the Lovász Local Lemma |
Maus, Yannic et al. |
2021 |
| 4 |
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs |
Cambus, Mélanie et al. |
2021 |
| 5 |
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping |
Brandt, Sebastian et al. |
2020 |
| 6 |
Tight Bounds for Deterministic High-Dimensional Grid Exploration |
Brandt, Sebastian et al. |
2020 |
| 7 |
A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration |
Brandt, Sebastian et al. |
2018 |
| 8 |
Distributed Recoloring |
Bonamy, Marthe et al. |
2018 |
| 9 |
Fine-grained Lower Bounds on Cops and Robbers |
Brandt, Sebastian et al. |
2018 |
| 10 |
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game |
Brandt, Sebastian et al. |
2017 |
| 11 |
Improved Distributed Degree Splitting and Edge Coloring |
Ghaffari, Mohsen et al. |
2017 |
| 12 |
Overcoming Obstacles with Ants |
Langner, Tobias et al. |
2016 |
