Author of the publication

More Efficient Periodic Traversal in Anonymous Undirected Graphs.

, , , , , , , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 167-181. 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. 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

Deterministic Computations on a PRAM with Static Processor and Memory Faults., , and . CoRR, (2018)Designing and Testing Temporally Connected Graphs., , , and . CoRR, (2015)On Temporally Connected Graphs of Small Cost., , , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 84-96. Springer, (2015)Optimal Pattern Matching on Meshes., and . STACS, volume 775 of Lecture Notes in Computer Science, page 213-224. Springer, (1994)The wake-up problem in multi-hop radio networks., , and . SODA, page 992-1000. SIAM, (2004)Fast Periodic Graph Exploration with Constant Memory., , , , and . SIROCCO, volume 4474 of Lecture Notes in Computer Science, page 26-40. Springer, (2007)Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown Attributes., , , and . PODC, page 4-13. ACM, (2019)Searching with Increasing Speeds., , and . SSS, volume 11201 of Lecture Notes in Computer Science, page 126-138. Springer, (2018)Approximate Dictionary Queries., and . CPM, volume 1075 of Lecture Notes in Computer Science, page 65-74. Springer, (1996)Deterministic Population Protocols for Exact Majority and Plurality., , , , and . OPODIS, volume 70 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)