( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights.

, , и . SSS, том 13046 из Lecture Notes in Computer Science, стр. 410-424. Springer, (2021)

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.

Hiroshi Wada

Koichi Matsumoto

Koichi Koshi

Eitaro Wada

Koichi Morikawa

 

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

PaRM: A parallel relaxation machine for handwritten character recognition., , и . Pattern Recognit. Lett., 19 (5-6): 475-481 (1998)Minimum Certificate Dispersal with Tree Structures, , , и . CoRR, (2011)Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs., , и . Syst. Comput. Jpn., 18 (11): 50-60 (1987)Asynchronous Gathering in a Torus., , , , и . OPODIS, том 217 из LIPIcs, стр. 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction., , , и . OPODIS, том 5923 из Lecture Notes in Computer Science, стр. 219-224. Springer, (2009)Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases., и . WG, том 1517 из Lecture Notes in Computer Science, стр. 324-336. Springer, (1998)Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs., и . WG, том 790 из Lecture Notes in Computer Science, стр. 132-143. Springer, (1993)Kakitsubata Team Description., , , , , , и . RoboCup, том 2019 из Lecture Notes in Computer Science, стр. 425-428. Springer, (2000)An approximation of data points by piecewise polynomial functions and their dual orthogonal functions, , , , и . Signal Processing, 80 (3): 507--514 (марта 2000)On Memory, Communication, and Synchronous Schedulers When Moving and Computing., , и . OPODIS, том 153 из LIPIcs, стр. 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)