( en | de | ru )

 

Disambiguation of "Dufoulon, Fabien"

Author of the publication

copydeleteadd this publication to your clipboard
Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity.

, , and . CoRR, (2022)

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.

Fabien Guilmineau

Fabien Abeille

Fabien Amarger

Fabien Gandon

Fabien Leurent

 

Other publications of authors with the same name

Can Uncoordinated Beeps tell Stories?, , and . PODC, page 408-417. ACM, (2020)Time- and Communication-Efficient Overlay Network Construction via Gossip., , , and . CoRR, (2023)Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity., , and . CoRR, (2022)Fast Beeping Protocols for Deterministic MIS and (Δ + 1)-Coloring in Sparse Graphs., , , and . INFOCOM, page 1754-1762. IEEE, (2018)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)Beeping Shortest Paths via Hypergraph Bipartite Decomposition., , and . CoRR, (2022)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)The Message Complexity of Distributed Graph Optimization., , , , and . CoRR, (2023)Time- and Communication-Efficient Overlay Network Construction via Gossip., , , and . ITCS, volume 287 of LIPIcs, page 42:1-42:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)