Gustav Schmid

According to our database, Gustav Schmid authored at least 6 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

LCLs Beyond Bounded Degrees.

Gustav Schmid

CoRR, February, 2026

Distributed Quantum Advantage in Locally Checkable Labeling Problems.

Alkida Balliu, Filippo Casagrande, Francesco d'Amore, Massimo Equi, Barbara Keller, Henrik Lievonen, Dennis Olivetti, Gustav Schmid, Jukka Suomela

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Distributed Algorithms for Potential Problems.

Alkida Balliu, Thomas Boudier, Francesco d'Amore, Dennis Olivetti, Gustav Schmid, Jukka Suomela

CoRR, July, 2025

2024

No Distributed Quantum Advantage for Approximate Graph Coloring.

Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Completing the Node-Averaged Complexity Landscape of LCLs on Trees.

Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

On the Node-Averaged Complexity of Locally Checkable Problems on Trees.

Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav Schmid

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