| 2026 | CONCUR | Monadic Presburger Predicates Have Robust Population Protocols. | Philipp Czerner, Javier Esparza, Vincent Fischer, Roland Guttenberg, Julian Pins, Simon Reilich |
| 2025 | TACAS | Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification. | Michael Blondin, Michal Cadilhac, Xin-Yi Cui, Philipp Czerner, Javier Esparza, Jakob Schulz |
| 2024 | CONCUR | Computing Inductive Invariants of Regular Abstraction Frameworks. | Philipp Czerner, Javier Esparza, Valentin Krasotin, Christoph Welzel-Mohr |
| 2024 | FOSSACS | A Resolution-Based Interactive Proof System for UNSAT. | Philipp Czerner, Javier Esparza, Valentin Krasotin |
| 2023 | CAV | Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms. | Eszter Couillard, Philipp Czerner, Javier Esparza, Rupak Majumdar |
| 2023 | PODC | Brief Announcement: Population Protocols Decide Double-exponential Thresholds. | Philipp Czerner |
| 2021 | FOSSACS | Running Time Analysis of Broadcast Consensus Protocols. | Philipp Czerner, Stefan Jaax |
| 2021 | PODC | Lower Bounds on the State Complexity of Population Protocols. | Philipp Czerner, Javier Esparza |
| 2021 | PODC | Decision Power of Weak Asynchronous Models of Distributed Computing. | Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza |
| 2020 | ESA | Compact Oblivious Routing in Weighted Graphs. | Philipp Czerner, Harald Rcke |