Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabien Dufoulon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. ITCS 2024: 41:1-41:26- [c11]Fabien Dufoulon, Michael Moorman, William K. Moses Jr., Gopal Pandurangan:
Time- and Communication-Efficient Overlay Network Construction via Gossip. ITCS 2024: 42:1-42:23 - [i7]Fabien Dufoulon, Pierre Fraigniaud, Mikaël Rabie, Hening Zheng:
Distributed Coloring in the SLEEPING Model. CoRR abs/2405.10058 (2024) - 2023
- [c10]Fabien Dufoulon
, Yuval Emek, Ran Gelles:
Beeping Shortest Paths via Hypergraph Bipartite Decomposition. ITCS 2023: 45:1-45:24 - [c9]Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan:
Distributed MIS in O(log log n) Awake Complexity. PODC 2023: 135-145 - [i6]Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. CoRR abs/2311.14811 (2023) - [i5]Fabien Dufoulon, Michael Moorman, William K. Moses Jr., Gopal Pandurangan:
Time- and Communication-Efficient Overlay Network Construction via Gossip. CoRR abs/2311.17115 (2023) - 2022
- [c8]Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg:
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. DISC 2022: 19:1-19:24 - [i4]Fabien Dufoulon, William K. Moses Jr., Gopal Pandurangan:
Sleeping is Superefficient: MIS in Exponentially Better Awake Complexity. CoRR abs/2204.08359 (2022) - [i3]Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, David Peleg:
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. CoRR abs/2210.01173 (2022) - [i2]Fabien Dufoulon, Yuval Emek, Ran Gelles:
Beeping Shortest Paths via Hypergraph Bipartite Decomposition. CoRR abs/2210.06882 (2022) - 2021
- [c7]Fabien Dufoulon, Shay Kutten, William K. Moses Jr.:
Efficient Deterministic Leader Election for Programmable Matter. PODC 2021: 103-113 - [i1]Fabien Dufoulon, Shay Kutten, William K. Moses Jr.:
Efficient Deterministic Leader Election for Programmable Matter. CoRR abs/2106.01108 (2021) - 2020
- [c6]Fabien Dufoulon, Janna Burman, Joffroy Beauquier:
Can Uncoordinated Beeps tell Stories? PODC 2020: 408-417
2010 – 2019
- 2019
- [b1]Fabien Dufoulon:
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 - [c5]Joffroy Beauquier, Janna Burman, Peter Davies, Fabien Dufoulon:
Optimal Multi-broadcast with Beeps Using Group Testing. SIROCCO 2019: 66-80 - 2018
- [c4]Joffroy Beauquier, Janna Burman, Fabien Dufoulon, Shay Kutten:
Fast Beeping Protocols for Deterministic MIS and (Δ + 1)-Coloring in Sparse Graphs. INFOCOM 2018: 1754-1762 - [c3]Fabien Dufoulon, Janna Burman, Joffroy Beauquier:
Brief Announcement: Beeping a Time-Optimal Leader Election. PODC 2018: 237-239 - [c2]Fabien Dufoulon, Janna Burman, Joffroy Beauquier:
Beeping a Deterministic Time-Optimal Leader Election. DISC 2018: 20:1-20:17 - 2017
- [c1]Alexandre Dambreville, Joanna Tomasik, Johanne Cohen, Fabien Dufoulon:
Load Prediction for Energy-Aware Scheduling for Cloud Computing Platforms. ICDCS 2017: 2604-2607
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-13 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
