( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Flocking with Oblivious Robots.

, , , и . SSS, том 10083 из Lecture Notes in Computer Science, стр. 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.

Izumi Kazuhara

Bogumi Izumi

 

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

Listing Center Strings Under the Edit Distance Metric., и . COCOA, том 9486 из Lecture Notes in Computer Science, стр. 771-782. Springer, (2015)Gathering Problem of Two Asynchronous Mobile Robots with Semi-dynamic Compasses., , , , и . SIROCCO, том 5058 из Lecture Notes in Computer Science, стр. 5-19. Springer, (2008)Fast Neighborhood Rendezvous., , и . ICDCS, стр. 168-178. IEEE, (2020)Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs., , , и . SPAA, стр. 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., , , , , и . Theor. Comput. Sci., (2015)Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices., , , , и . CoRR, (2022)A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching., , и . CoRR, (2023)Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model., и . PODC, стр. 84-93. ACM, (2019)Bounds on asymptotic rate of capacitive crosstalk avoidance codes for on-chip buses., и . ISIT, стр. 400-404. IEEE, (2016)Brief Announcement: Fast Aggregation in Population Protocols., и . DISC, том 91 из LIPIcs, стр. 49:1-49:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)