Author of the publication

Making Distributed Spanning Tree Algorithms Fault-Resilient.

, , , and . STACS, volume 247 of Lecture Notes in Computer Science, page 432-444. Springer, (1987)

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

Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks., , , and . SIAM J. Discret. Math., 32 (3): 1903-1921 (2018)Dynamic Wavelength Allocation in All-Optical Ring Networks., and . ICC (1), page 432-436. IEEE, (1997)On Broadcasting in Radio Networks-Problem Analysis and Protocol Design., and . IEEE Trans. Commun., 33 (12): 1240-1246 (1985)Stepwise construction of an efficient distributed traversing algorithm for general strongly connected directed networks or: Traversing one way streets with no map.. ICCC, page 446-452. International Council for Computer Communication / Elsevier, (1988)Optimal maintenance of a spanning tree., , and . J. ACM, 55 (4): 18:1-18:45 (2008)Maintenance of a Spanning Tree in Dynamic Networks., and . DISC, volume 1693 of Lecture Notes in Computer Science, page 342-355. Springer, (1999)Optimal Computation of Global Sensitive Functions in Fast Networks., , and . WDAG, volume 486 of Lecture Notes in Computer Science, page 185-191. Springer, (1990)Greedy Packet Scheduling., , , and . WDAG, volume 486 of Lecture Notes in Computer Science, page 169-184. Springer, (1990)Time Optimal Synchronous Self Stabilizing Spanning Tree., and . DISC, volume 8205 of Lecture Notes in Computer Science, page 91-105. Springer, (2013)A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms., , and . PODC, page 163-174. ACM, (1985)