1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DC2026
Monadic Presburger Predicates have Robust Population Protocols
Philipp Czerner, Javier Esparza, Vincent Fischer +3
Population protocols are a model of distributed computation in which a collection of indistinguishable finite-state agents interact randomly in pairs to decide a predicate of their…
cs.DC2021
Running Time Analysis of Broadcast Consensus Protocols
Philipp Czerner, Stefan Jaax
Broadcast consensus protocols (BCPs) are a model of computation, in which anonymous, identical, finite-state agents compute by sending/receiving global broadcasts. BCPs are known t…
cs.NI2020★ 1 cited
Compact Oblivious Routing in Weighted Graphs
Philipp Czerner, Harald Räcke
The space-requirement for routing-tables is an important characteristic of routing schemes. For the cost-measure of minimizing the total network load there exist a variety of resul…