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

Fast and Succinct Population Protocols for Presburger Arithmetic. - Philipp Czerner; Roland Guttenberg; Martin Helfrich; Javier Esparza (SAND, 2022)

Geometry of VAS reachability sets. - Roland Guttenberg; Mikhail A. Raskin (CoRR, 2022)

Geometry of Reachability Sets of Vector Addition Systems. - Roland Guttenberg; Mikhail A. Raskin; Javier Esparza (CONCUR, 2023)

Verification of Population Protocols with Unordered Data is undecidable. - Roland Guttenberg (CoRR, 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)

Verification of Population Protocols with Unordered Data. - Steffen van Bergerem; Roland Guttenberg; Sandra Kiefer; Corto Mascle; Nicolas Waldburger; Chana Weil-Kennedy (ICALP, 2024)

Flattability of Priority Vector Addition Systems. - Roland Guttenberg (ICALP, 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)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests. - Roland Guttenberg; Wojciech Czerwinski; Slawomir Lasota 001 (LICS, 2025)

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

PVASS Reachability is Decidable. - Roland Guttenberg; Eren Keskin; Roland Meyer 001 (CoRR, 2025)