Multi-agent programming contest 2017: lampe team description. - Philipp Czerner; Jonathan Pieper (Ann. Math. Artif. Intell., 2018)

Multi-agent programming contest 2016: lampe team description. - Philipp Czerner; Jonathan Pieper (Int. J. Agent Oriented Softw. Eng., 2018)

Compact Oblivious Routing in Weighted Graphs. - Philipp Czerner; Harald Räcke (ESA, 2020)

Running Time Analysis of Broadcast Consensus Protocols. - Philipp Czerner; Stefan Jaax (FoSSaCS, 2021)

Lower Bounds on the State Complexity of Population Protocols. - Philipp Czerner; Javier Esparza (PODC, 2021)

Decision Power of Weak Asynchronous Models of Distributed Computing. - Philipp Czerner; Roland Guttenberg; Martin Helfrich; Javier Esparza (PODC, 2021)

Leaderless Population Protocols Decide Double-exponential Thresholds. - Philipp Czerner (CoRR, 2022)

Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms. - Eszter Couillard; Philipp Czerner; Javier Esparza; Rupak Majumdar (CAV (3), 2023)

Brief Announcement: Population Protocols Decide Double-exponential Thresholds. - Philipp Czerner (PODC, 2023)

Making IP=PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms. - Eszter Couillard; Philipp Czerner; Javier Esparza; Rupak Majumdar (CoRR, 2023)

Lower bounds on the state complexity of population protocols. - Philipp Czerner; Javier Esparza; Jérôme Leroux (Distributed Comput., 2023)

The Black Ninjas and the Sniper: On Robust Population Protocols. - Benno Lossin; Philipp Czerner; Javier Esparza; Roland Guttenberg; Tobias Prehn (Principles of Verification (3), 2024)

Computing Inductive Invariants of Regular Abstraction Frameworks. - Philipp Czerner; Javier Esparza; Valentin Krasotin; Christoph Welzel-Mohr (CONCUR, 2024)

A Resolution-Based Interactive Proof System for UNSAT. - Philipp Czerner; Javier Esparza; Valentin Krasotin (FoSSaCS (2), 2024)

Breaking Through the Ω(n)-Space Barrier: Population Protocols Decide Double-Exponential Thresholds. - Philipp Czerner (DISC, 2024)

Brief Announcement: The Expressive Power of Uniform Population Protocols with Logarithmic Space. - Philipp Czerner; Vincent Fischer 004; Roland Guttenberg (DISC, 2024)

The Black Ninjas and the Sniper: On Robustness of Population Protocols. - Benno Lossin; Philipp Czerner; Javier Esparza; Roland Guttenberg; Tobias Prehn (CoRR, 2024)

Fast and succinct population protocols for Presburger arithmetic. - Philipp Czerner; Roland Guttenberg; Martin Helfrich; Javier Esparza (J. Comput. Syst. Sci., 2024)

dodo. - Christoph Welzel-Mohr; Valentin Krasotin; Philipp Czerner; Javier Esparza (Zenodo, 2024)

The Expressive Power of Uniform Population Protocols with Logarithmic Space. - Philipp Czerner; Vincent Fischer 004; Roland Guttenberg (SAND, 2025)

Undecidability of the Emptiness Problem for Weak Models of Distributed Computing. - Flavio T. Principato; Javier Esparza; Philipp Czerner (SAND, 2025)

Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification. - Michael Blondin; Michaël Cadilhac; Xin-Yi Cui; Philipp Czerner; Javier Esparza; Jakob Schulz (TACAS (3), 2025)

Computational Limits of Population Protocols: Space Complexity, Robustness and Expressive Power. - Philipp Czerner (2025)