Author of the publication

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

Can Uncoordinated Beeps tell Stories?, , and . PODC, page 408-417. ACM, (2020)Beeping Shortest Paths via Hypergraph Bipartite Decomposition., , and . ITCS, volume 251 of LIPIcs, page 45:1-45:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Efficient Deterministic Leader Election for Programmable Matter., , and . PODC, page 103-113. ACM, (2021)Time- and Communication-Efficient Overlay Network Construction via Gossip., , , and . CoRR, (2023)Fast Beeping Protocols for Deterministic MIS and (Δ + 1)-Coloring in Sparse Graphs., , , and . INFOCOM, page 1754-1762. IEEE, (2018)The Message Complexity of Distributed Graph Optimization., , , , and . ITCS, volume 287 of LIPIcs, page 41:1-41:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)An Almost Singularly Optimal Asynchronous Distributed MST Algorithm., , , , and . DISC, volume 246 of LIPIcs, page 19:1-19:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Distributed MIS in O(log log n) Awake Complexity., , and . PODC, page 135-145. ACM, (2023)Optimal Multi-broadcast with Beeps Using Group Testing., , , and . SIROCCO, volume 11639 of Lecture Notes in Computer Science, page 66-80. Springer, (2019)Overcoming interference in the beeping communication model. (Surmonter les interférences dans le modèle de communication par bips).. University of Paris-Saclay, France, (2019)