Author of the publication

Decision Power of Weak Asynchronous Models of Distributed Computing

, , , and . PODC '21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021, page 115--125. ACM, (July 2021)
DOI: 10.1145/3465084.3467918

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms., , , and . CAV (3), volume 13966 of Lecture Notes in Computer Science, page 437-458. Springer, (2023)Running Time Analysis of Broadcast Consensus Protocols., and . FoSSaCS, volume 12650 of Lecture Notes in Computer Science, page 164-183. Springer, (2021)Lower Bounds on the State Complexity of Population Protocols., and . PODC, page 45-54. ACM, (2021)A Resolution-Based Interactive Proof System for UNSAT., , and . FoSSaCS (2), volume 14575 of Lecture Notes in Computer Science, page 116-136. Springer, (2024)Brief Announcement: Population Protocols Decide Double-exponential Thresholds.. PODC, page 28-31. ACM, (2023)Lower bounds on the state complexity of population protocols., , and . Distributed Comput., 36 (3): 209-218 (September 2023)Multi-agent programming contest 2017: lampe team description., and . Ann. Math. Artif. Intell., 84 (1-2): 95-115 (2018)Fast and succinct population protocols for Presburger arithmetic., , , and . J. Comput. Syst. Sci., (March 2024)Fast and Succinct Population Protocols for Presburger Arithmetic., , , and . SAND, volume 221 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Decision Power of Weak Asynchronous Models of Distributed Computing., , , and . PODC, page 115-125. ACM, (2021)