Author of the publication

Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms

, , , and . Computer Aided Verification - 35th International Conference, CAV 2023, Paris, France, July 17-22, 2023, Proceedings, Part III, volume 13966 of Lecture Notes in Computer Science, page 437--458. Springer, (2023)
DOI: 10.1007/978-3-031-37709-9_21

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

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)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)Brief Announcement: Population Protocols Decide Double-exponential Thresholds.. PODC, page 28-31. ACM, (2023)Multi-agent programming contest 2016: lampe team description., and . IJAOSE, 6 (1): 101-117 (2018)Leaderless Population Protocols Decide Double-exponential Thresholds.. CoRR, (2022)Making IP=PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms., , , and . CoRR, (2023)Compact Oblivious Routing in Weighted Graphs., and . ESA, volume 173 of LIPIcs, page 36:1-36:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Multi-agent programming contest 2017: lampe team description., and . Ann. Math. Artif. Intell., 84 (1-2): 95-115 (2018)