PaVeS at PODC

Published by Christoph Welzel on

The PaVeS group contributed with two accepted papers to PODC’21: “Lower Bounds on the State Complexity of Population Protocols” by Philipp Czerner and Javier Esparza, and “Decision Power of Weak Asynchronous Models of Distributed Computing” by Philipp Czerner, Roland Guttenberg, Martin Helfrich, and Javier Esparza. Additionally, Roland Guttenberg presented this work at a TopMath-Talk.

Categories: ConferencePaperResearch

Related Posts

Research

Research visit of Ahmed Bouajjani in June and July

The PaVeS people are excited to host Ahmed Bouajjani on a research visit to the Chair of theoretical computer science of the Technical University of Munich.

Conference

PaVeS @ FoSSaCS’22

The PaVeS group contributed  to FoSSaCS’22 with two papers: “Separators in Continuous Petri Nets” by Miachel Blondin and Javier Esparza “Parameterized Analysis of Reconfigurable Broadcast Networks” by A. R. Balasubramanian, Lucie Guillou and Chana Weil-Kennedy

Conference

Submission & Best Paper Award for PaVeS @ SAND’22

Philipp Czerner, Roland Guttenberg, Martin Helfrich, and Javier Esparza contribute to SAND’21 with their paper “Fast and Succinct Population Protocols for Presburger Arithmetic” (preprint). There contribution is recognized with SAND’s Best Paper Award.