[dblp link]

Conference Papers

2019

  • Sebastian Brandt, Yannic Maus and Jara Uitto
    A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma.
    The 38th ACM Symposium on Principles of Distributed Computing (PODC'19).
    [arxiv]
  • Yannic Maus
    BA: P-SLOCAL-Completeness of Maximum Independent Set Approximation.
    The 38th ACM Symposium on Principles of Distributed Computing (PODC'19).
    [arxiv]
  • Janosch Deurer, Fabian Kuhn, Yannic Maus
    Deterministic Distributed Dominating Set Approximation in the CONGEST Model.
    The 38th ACM Symposium on Principles of Distributed Computing (PODC'19).
    [arxiv]
  • Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus and Jara Uitto
    On the Complexity of Distributed Splitting Problems.
    The 38th ACM Symposium on Principles of Distributed Computing (PODC'19).
    [arxiv]
  • Frederik Mallmann-Trenn, Yannic Maus, Dominik Pajak
    Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol.
    46th International Colloquium on Automata, Languages and Programming (ICALP '19)
    [arxiv]
  • Philipp Bamberger, Fabian Kuhn, Yannic Maus
    Local Distributed Algorithms in Highly Dynamic Networks
    2019 33rd IEEE Int. Parallel and Distributed Processing Symposium (IPDPS '19)
    [arxiv]

2018

  • Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Juho Hirvonen
    Improved Distributed Delta-Coloring
    2018 ACM Symposium on Principles of Distributed Computing (PODC '18)
    [arxiv]
  • Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto
    Deterministic Distributed Edge-Coloring with Fewer Colors
    2018 50th ACM Symposium on Theory of Computing (STOC '18)
    [arxiv]
  • Fabian Kuhn, Yannic Maus, Simon Weidner
    Deterministic Distributed Ruling Sets of Line Graphs
    2018 Int. Coll. on Structural Information and Communication Complexity (SIROCCO '18)
    [arxiv]

2017

  • Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla
    Greedy Routing and the Algorithmic Small-World Phenomenon
    2017 36th ACM Symposium on Principles of Distributed Computing (PODC '17)
    [arxiv]
  • Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto
    Improved Distributed Degree Splitting and Edge Coloring
    2017 International Symposium on DIStributed Computing (DISC '17)
    [arxiv]
    Best Paper Award.
  • Mohsen Ghaffari, Fabian Kuhn, Yannic Maus
    On the Complexity of Local Distributed Graph Problems
    2017 ACM Symposium on Theory of Computing (STOC '17)
    [arxiv]

2016

  • Dan Hefetz, Fabian Kuhn, Yannic Maus, Angelika Steger
    Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model
    2016 30th International Symposium on DIStributed Computing (DISC '16), Paris, September 26-30, 2016
    [arxiv]
    Best Paper Award.
  • Fabian Kuhn, Sebastian Daum, Yannic Maus
    Rumor Spreading with Bounded In-Degree
    2016 23rd Int. Coll. on Structural Information and Communication Complexity (SIROCCO '16), Helsinki, Finland
    [arxiv]
    Best Paper Award.

2015

  • Fabian Kuhn, Sebastian Daum, Yannic Maus
    BA: Rumor Spreading with Bounded In-Degree
    2015 26th Int. Symp. on Distributed Computing (DISC '15), Tokyo, Japan

Journal Papers

  • Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela and Jara Uitto
    Improved Distributed Degree Splitting and Edge Coloring.
    Distributed Computing, 2019.
    [journal version]
  • Fabian Kuhn, Sebastian Daum, Yannic Maus
    Rumor Spreading with Bounded In-Degree
    Theoretical Computer Science 2018
    [journal version]


Theses

  • The Power of Locality: Exploring the Limits of Randomness in Distributed Computing.
    University of Freiburg, Freiburg im Breisgau, Germany 2018 (PhD Thesis)
    GI Dissertationspreis 2018 and Wolfgang-Gentner-Nachwuchsförderpreis 2019
    [Freidok (Uni Freiburg)]
  • Master Thesis (Mathematics) - Wavelet Riesz Bases Associated to Nonisotropic Dilations
  • Bachelor Thesis (Mathematics) - Frames of Lattice Translates
  • Bachelor Thesis (Computer Science) - Automaton Operators in Logics for Recursive Programs