Algorithms and Complexity (Freiburg)

Gustav Schmid

Albert-Ludwigs-Universität
Institut für Informatik
Georges-Köhler-Allee 106
D - 79110 Freiburg im Breisgau

Room:

106-00-004

Email: gustav.schmid@cs.uni-freiburg.de

I am currently a PhD at the Algorithms and Complexity group at the university of Freiburg. I earned my M.Sc from the University of Freiburg, Germany. I earned my B.Sc. from the Ostbayerische Technische Hochschule Regensburg, Germany. My current research interests lie in the complexity landscapes of Locally Checkable Labelings and distributed graph algorithms.
I am especially interested in understanding why our definitions take the form they do and how far our results can be generalized. I like the process of refining definitions until they feel exactly right, and the moment when a complicated, messy proof resolves into something clear and elegant.

Publications

Conference Papers (arXiv version)

Alkida Balliu, Filippo Casagrande, Francesco d'Amore, Massimo Equi, Barbara Keller, Henrik Lievonen, Dennis Olivetti, Gustav Schmid, Jukka Suomela
Distributed Quantum Advantage in Locally Checkable Labeling Problems
Symposium on Discrete Algorithms (SODA 2026)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti and Gustav Schmid
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
ACM Symposium on Principles of Distributed Computing (PODC 2024)
Xavier Coiteux-Roy, Francesco dAmore, Rishikesh Gajjala, Fabian Kuhn, FranÃ§ois Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela
No distributed quantum advantage for approximate graph coloring
ACM Symposium on Theory of Computing (STOC 2024)
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti and Gustav Schmid
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
International Symposium on Distributed Computing (DISC 2023)
(Best Paper Award)

Gustav Schmid

Publications

Teachings