Affiliation:
1. Technical University of Munich, Munich, Germany
Funder
Agence Nationale de la Recherche
H2020 European Research Council
UMI Relax
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lower bounds on the state complexity of population protocols;Distributed Computing;2023-06-15
2. Lower Bounds on the State Complexity of Population Protocols;Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing;2021-07-21
3. Decidability and Complexity in Weakening and Contraction Hypersequent Substructural Logics;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
4. Population Protocols: Beyond Runtime Analysis;Lecture Notes in Computer Science;2021
5. Extended Kripke lemma and decidability for hypersequent substructural logics;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08