( en | de | ru )

 

Disambiguation of "Izumi, Taisuke"

Author of the publication

copydeleteadd this publication to your clipboard
Flocking with Oblivious Robots.

, , , and . SSS, volume 10083 of Lecture Notes in Computer Science, page 94-108. (2016)

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.

Izumi Kazuhara

Bogumi Izumi

 

Other publications of authors with the same name

Triangle Finding and Listing in CONGEST Networks., and . PODC, page 381-389. ACM, (2017)On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols, , , , , and . Theoretical Computer Science, (2019)Fast Neighborhood Rendezvous., , and . ICDCS, page 168-178. IEEE, (2020)Listing Center Strings Under the Edit Distance Metric., and . COCOA, volume 9486 of Lecture Notes in Computer Science, page 771-782. Springer, (2015)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)Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs., , , and . SPAA, page 11-22. ACM, (2022)Corrigendum to Ön the approximability and hardness of minimum topic connected overlay and its special instances" Theoret. Comput. Sci. 429(2012) 144-154., , , , , and . Theor. Comput. Sci., (2015)Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices., , , , and . CoRR, (2022)A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching., , and . CoRR, (2023)Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model., and . PODC, page 84-93. ACM, (2019)