| No. |
Title |
Author |
Year |
| 1 |
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility |
Castenow, Jannik et al. |
2023 |
| 2 |
Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings |
Damerius, Christoph et al. |
2023 |
| 3 |
On Greedily Packing Anchored Rectangles |
Damerius, Christoph et al. |
2021 |
| 4 |
On the Complexity of Anchored Rectangle Packing |
Antoniadis, Antonios et al. |
2019 |
| 5 |
A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States |
Berenbrink, Petra et al. |
2018 |
| 6 |
Simple and Efficient Leader Election |
Berenbrink, Petra et al. |
2018 |
| 7 |
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time |
Berenbrink, Petra et al. |
2016 |
| 8 |
Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing |
Berenbrink, Petra et al. |
2016 |
| 9 |
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules |
Antoniadis, Antonios et al. |
2014 |
