Author of the publication

Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses.

, , , , and . SIROCCO, volume 5058 of Lecture Notes in Computer Science, page 5-19. Springer, (2008)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An approximation of data points by piecewise polynomial functions and their dual orthogonal functions, , , , and . Signal Processing, 80 (3): 507--514 (March 2000)PaRM: A parallel relaxation machine for handwritten character recognition., , and . Pattern Recognit. Lett., 19 (5-6): 475-481 (1998)Minimum Certificate Dispersal with Tree Structures, , , and . CoRR, (2011)Fault-tolerant network routings for (k + 1)-node connected and (k + 1)-edge connected graphs., , and . Syst. Comput. Jpn., 18 (11): 50-60 (1987)Architecture and Performance of Dynamic Offloading Mechanism for Maestro2 Cluster Network., , , and . Inf. Media Technol., 2 (4): 1093-1102 (2007)Asynchronous Gathering in a Torus., , , , and . OPODIS, volume 217 of LIPIcs, page 9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On Memory, Communication, and Synchronous Schedulers When Moving and Computing., , and . OPODIS, volume 153 of LIPIcs, page 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Brief Announcement: Communication-Efficient Self-stabilizing Protocols for Spanning-Tree Construction., , , and . OPODIS, volume 5923 of Lecture Notes in Computer Science, page 219-224. Springer, (2009)Kakitsubata Team Description., , , , , , and . RoboCup, volume 2019 of Lecture Notes in Computer Science, page 425-428. Springer, (2000)Linear Algorithms for a k-partition Problem of Planar Graphs without Specifying Bases., and . WG, volume 1517 of Lecture Notes in Computer Science, page 324-336. Springer, (1998)