On the Node-Averaged Complexity of Locally Checkable Problems on Trees. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti; Gustav Schmid (DISC, 2023)

Completing the Node-Averaged Complexity Landscape of LCLs on Trees. - Alkida Balliu; Sebastian Brandt 002; Fabian Kuhn; Dennis Olivetti; Gustav Schmid (PODC, 2024)

No Distributed Quantum Advantage for Approximate Graph Coloring. - Xavier Coiteux-Roy; Francesco D'Amore 001; Rishikesh Gajjala; Fabian Kuhn; François Le Gall; Henrik Lievonen; Augusto Modanese; Marc-Olivier Renou; Gustav Schmid; Jukka Suomela (STOC, 2024)

Distributed Quantum Advantage in Locally Checkable Labeling Problems. - Alkida Balliu; Filippo Casagrande; Francesco D'Amore 001; Massimo Equi; Barbara Keller; Henrik Lievonen; Dennis Olivetti; Gustav Schmid; Jukka Suomela (CoRR, 2025)

Distributed Algorithms for Potential Problems. - Alkida Balliu; Thomas Boudier; Francesco D'Amore 001; Dennis Olivetti; Gustav Schmid; Jukka Suomela (CoRR, 2025)