From post

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

, , , и . Computer Aided Verification - 35th International Conference, CAV 2023, Paris, France, July 17-22, 2023, Proceedings, Part III, том 13966 из Lecture Notes in Computer Science, стр. 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.

 

Другие публикации лиц с тем же именем

Running Time Analysis of Broadcast Consensus Protocols., и . FoSSaCS, том 12650 из Lecture Notes in Computer Science, стр. 164-183. Springer, (2021)Making sf IP=sf PSPACE Practical: Efficient Interactive Protocols for BDD Algorithms., , , и . CAV (3), том 13966 из Lecture Notes in Computer Science, стр. 437-458. Springer, (2023)Lower Bounds on the State Complexity of Population Protocols., и . PODC, стр. 45-54. ACM, (2021)A Resolution-Based Interactive Proof System for UNSAT., , и . FoSSaCS (2), том 14575 из Lecture Notes in Computer Science, стр. 116-136. Springer, (2024)Brief Announcement: Population Protocols Decide Double-exponential Thresholds.. PODC, стр. 28-31. ACM, (2023)Multi-agent programming contest 2016: lampe team description., и . 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., , , и . CoRR, (2023)Compact Oblivious Routing in Weighted Graphs., и . ESA, том 173 из LIPIcs, стр. 36:1-36:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Multi-agent programming contest 2017: lampe team description., и . Ann. Math. Artif. Intell., 84 (1-2): 95-115 (2018)