( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

, , и . Foundations of Software Science and Computation Structures - 24th International Conference, том 12650 из Lecture Notes in Computer Science, стр. 42--61. Springer, (2021)
DOI: 10.1007/978-3-030-71995-1_3

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.

Peter Raskin

Richard Raskin

Gisela Raskin

Katrin Raskin

Heinrich Raskin

 

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

Affine Extensions of Integer Vector Addition Systems with States., , , и . Log. Methods Comput. Sci., (2021)Examples for submission to CONCUR'22., , и . (апреля 2022)A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model.. ICALP, том 80 из LIPIcs, стр. 88:1-88:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Computing Parameterized Invariants of Parameterized Petri Nets., , и . Petri Nets, том 12734 из Lecture Notes in Computer Science, стр. 141-163. Springer, (2021)Regular Model Checking Upside-Down: An Invariant-Based Approach., , и . CONCUR, том 243 из LIPIcs, стр. 23:1-23:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Complexity of Verifying Population Protocols., , , и . Distributed Computing, (2021)https://arxiv.org/abs/1912.06578.The Complexity of Verifying Population Protocols., , , и . (2019)The Complexity of Reachability in Affine Vector Addition Systems with States., и . LICS, стр. 224-236. ACM, (2020)Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy., , и . FoSSaCS, том 12650 из Lecture Notes in Computer Science, стр. 42-61. Springer, (2021)ostrich., , и . (февраля 2020)