( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Meeting in a Polygon by Anonymous Oblivious Robots.

, , , , и . DISC, том 91 из LIPIcs, стр. 14:1-14:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Masafumi Nakanishi

Masafumi Tanaka

Masafumi Tanaka

Kiyonobu Yamashita

Miki Yamashita

 

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

Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots., , , , и . CoRR, (2017)Computing on an Anonymous Network., и . PODC, стр. 117-130. ACM, (1988)Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction., , , и . SSS, том 8255 из Lecture Notes in Computer Science, стр. 86-97. Springer, (2013)Computing on Anonymous Networks: Part II-Decision and Membership Problems., и . IEEE Trans. Parallel Distributed Syst., 7 (1): 90-96 (1996)A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States., , и . IEEE Trans. Parallel Distributed Syst., 9 (6): 579-584 (1998)Exploration of Finite 2D Square Grid by a Metamorphic Robotic System., , , и . SSS, том 11201 из Lecture Notes in Computer Science, стр. 96-110. Springer, (2018)A Template Matching Algorithm Using Optically-Connected 3-D VLSI Architecture., , , и . ISCA, стр. 64-70. (1987)How to Design a Linear Cover Time Random Walk on a Finite Graph., , , и . SAGA, том 5792 из Lecture Notes in Computer Science, стр. 104-116. Springer, (2009)Probabilistic Self-Stabilization and Random Walks.. ICNC, стр. 1-7. IEEE Computer Society, (2011)An Extension of Matthews' Bound to Multiplex Random Walks., , , , и . IPDPS Workshops, стр. 872-877. IEEE Computer Society, (2012)