Author of the publication

Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition.

, , and . CoRR, (2021)

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

Bounds for Some Functions Concerning Dynamic Storage Allocation.. J. ACM, 21 (3): 491-499 (1974)Transitive Closure in Parallel on a Linear Network of Processors., , and . Parallel Process. Lett., (1992)Spanning Trees of Bounded Degree Graphs.. Moderately Exponential Time Algorithms, volume 08431 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Design patterns in beeping algorithms: Examples, emulation, and analysis., , , and . Inf. Comput., (2019)Algorithm 362: generation of random permutations G6.. Commun. ACM, 12 (11): 634-635 (1969)An Estimate of the Store Size Necessary for Dynamic Storage Allocation.. J. ACM, 18 (2): 416-423 (1971)Efficient Simulations by Queue Machines., and . SIAM J. Comput., 35 (5): 1059-1069 (2006)On Quadratic Word Equations., and . STACS, volume 1563 of Lecture Notes in Computer Science, page 217-226. Springer, (1999)Spanning Trees of Bounded Degree Graphs. CoRR, (2009)Quadratic Word Equations., and . Jewels are Forever, page 314-326. Springer, (1999)