Algorithms and Complexity

Philipp Schneider

Contact Information

Philipp Schneider

Research Interest

My field of interest can be broadly classified as Theoretical Computer Science and Algorithm Theory. More specifically, I am currently researching distributed algorithms with a focus on algorithms for hybrid and wireless networks.


Years: 2020 | 2017


    Conference papers
    • Fabian Kuhn, Philipp Schneider
      Computing Shortest Paths and Diameter in the Hybrid Network Model.
      2020 39th ACM Symposium on Principles of Distributed Computing (PODC)
    • John Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider
      Shortest Paths in a Hybrid Network Model
      2020 31st ACM-SIAM Symp. on Discrete Algorithms (SODA)


    Conference papers


    Over the years I assisted teaching in various lectures and taught a few preparation courses.

    Summer Term 2020:

    Winter Term 2019/2020:

    Summer Term 2019:

    Winter Term 2018/2019:

    Summer Term 2018:

    Winter Term 2017/2018:

    Summer Term 2017:

    Winter Term 2016/2017: