PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Blin, Lélia"

Author of the publication

copydeleteadd this publication to your clipboard
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.

, , and . DISC, volume 7611 of Lecture Notes in Computer Science, page 403-404. Springer, (2012)

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.

Prof. Dr. Gerd Blind University of Stuttgart

Marcel Blind University of Stuttgart

 

Other publications of authors with the same name

Self-stabilizing minimum-degree spanning tree within one from the optimal degree., , and . IPDPS, page 1-11. IEEE, (2009)Distributed chasing of network intruders., , , and . Theor. Comput. Sci., 399 (1-2): 12-37 (2008)Hardness Results and Heuristic for Multi-groups Interconnection., , , and . Comput. J., 53 (9): 1497-1507 (2010)A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon., , and . J. Parallel Distrib. Comput., (2018)On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms., , and . SSS, volume 8756 of Lecture Notes in Computer Science, page 18-32. Springer, (2014)Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative., and . CoRR, (2014)Compact Self-Stabilizing Leader Election for General Networks., and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 161-173. Springer, (2018)Fair cost-sharing methods for the minimum spanning tree game., , , and . Inf. Process. Lett., 100 (1): 29-35 (2006)On asynchronous rendezvous in general graphs., , , , , , and . Theor. Comput. Sci., (2019)Compact Self-Stabilizing Leader Election for Arbitrary Networks., and . CoRR, (2017)