From post

Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees.

, и . OPODIS, том 5923 из Lecture Notes in Computer Science, стр. 365-371. Springer, (2009)

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.

 

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

Distributed Computation for Swapping a Failing Edge., , и . IWDC, том 3326 из Lecture Notes in Computer Science, стр. 28-39. Springer, (2004)Mobile Search for a Black Hole in an Anonymous Ring., , , и . Algorithmica, 48 (1): 67-90 (2007)Linear Time Distributed Swap Edge Algorithms., , , и . CIAC, том 7878 из Lecture Notes in Computer Science, стр. 122-133. Springer, (2013)Distributed Computation of All Node Replacements of a Minimum Spanning Tree., , , , и . Euro-Par, том 4641 из Lecture Notes in Computer Science, стр. 598-607. Springer, (2007)Gathering Autonomous Mobile Robots., и . SIROCCO, том 13 из Proceedings in Informatics, стр. 57-72. Carleton Scientific, (2002)Searching for a black hole in arbitrary networks: optimal mobile agent protocols., , , и . PODC, стр. 153-161. ACM, (2002)Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility., , , , и . PODC, стр. 9-19. ACM, (2021)Getting Close without Touching., , и . SIROCCO, том 7355 из Lecture Notes in Computer Science, стр. 315-326. Springer, (2012)Gathering in Dynamic Rings., , , , , и . SIROCCO, том 10641 из Lecture Notes in Computer Science, стр. 339-355. Springer, (2017)Gathering in dynamic rings., , , , , и . Theor. Comput. Sci., (2020)