Philipp Czerner

I currently am a doctoral candidate in computer science advised by Prof. Javier Esparza in the Chair for Foundations of Software Reliability and Theoretical Computer Science at Technical University of Munich. My research focus is on the verification of systems with stochastically interacting identical agents, in particular population protocols and chemical reaction networks. Previously, I studied problems related to oblivious routing.

My hobbies include programming (mostly in C(++)), reading, badminton, playing piano, and games, both on PC and boardgames. Notable prior projects include obst, a visualisation of binary decision diagrams for teaching and learning, and my participations in the Multi-Agent Programming Contest in the years 2016 and 2017 as part of team lampe.

You can also find me on Google Scholar.

Contact: contact@nicze.de


Figure 1: I

Past Projects

Publications and Theses

  1. Philipp Czerner: Semi-oblivious Routing Strategies in Directed Graphs,
    Master's Thesis in Informatics at TU Munich, 2020 [pdf]
  2. Philipp Czerner, Harald Räcke: Compact Oblivious Routing in Weighted Graphs,
    28th Annual European Symposium on Algorithms (ESA 2020), pages 36:1-36:23, 2020 [pdf] [talk] [slides] [doi]
  3. Philipp Czerner: How realistic is a change coupling graph? Estimations with convolutional networks,
    Bachelor's Thesis in Informatics at TU Clausthal, 2018 [pdf] [code]
  4. Philipp Czerner, Jonathan Pieper: Multi-agent programming contest 2017: lampe team description,
    Annals of Mathematics and Artificial Intelligence, pages 95-115, 2018 [pdf] [html] [code] [doi]
  5. Philipp Czerner, Jonathan Pieper: Multi-agent programming contest 2016: lampe team description,
    International Journal of Agent-Oriented Software Engineering, pages 101-117, 2018 [pdf] [html] [code] [doi]