| 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 |
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics |
Brandt, Sebastian et al. |
2022 |
| 5 |
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees |
Brandt, Sebastian et al. |
2021 |
| 6 |
Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping |
Brandt, Sebastian et al. |
2020 |
| 7 |
Classification of Distributed Binary Labeling Problems |
Balliu, Alkida et al. |
2020 |
| 8 |
Tight Bounds for Deterministic High-Dimensional Grid Exploration |
Brandt, Sebastian et al. |
2020 |
| 9 |
Two-Dimensional Rule Language for Querying Sensor Log Data: A Framework and Use Cases |
Brandt, Sebastian et al. |
2019 |
| 10 |
A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration |
Brandt, Sebastian et al. |
2018 |
| 11 |
Almost Global Problems in the LOCAL Model |
Balliu, Alkida et al. |
2018 |
| 12 |
Fine-grained Lower Bounds on Cops and Robbers |
Brandt, Sebastian et al. |
2018 |
| 13 |
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game |
Brandt, Sebastian et al. |
2017 |
