From post

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.

 

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

Line-Recovery by Programmable Particles., , , , и . CoRR, (2017)On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols, , , , , и . Theoretical Computer Science, (2019)Edge-guarding Orthogonal Polyhedra., , , , , , , и . CCCG, (2011)Hardness of Mastermind.. FUN, том 7288 из Lecture Notes in Computer Science, стр. 368-378. Springer, (2012)TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications., , , и . Distributed Comput., 35 (2): 105-122 (2022)Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks., и . DISC, том 281 из LIPIcs, стр. 18:1-18:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks., и . PODC, стр. 176-179. ACM, (2023)A Rupestrian Algorithm., , , , и . FUN, том 49 из LIPIcs, стр. 14:1-14:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Pushing Blocks by Sweeping Lines., , и . FUN, том 226 из LIPIcs, стр. 1:1-1:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem., , , и . OPODIS, том 8878 из Lecture Notes in Computer Science, стр. 217-232. Springer, (2014)