| Beeping a deterministic time-optimal leader election F Dufoulon, J Burman, J Beauquier 32nd International Symposium on Distributed Computing (DISC 2018), 2018 | 27 | 2018 |
| Load prediction for energy-aware scheduling for cloud computing platforms A Dambreville, J Tomasik, J Cohen, F Dufoulon 2017 IEEE 37th International Conference on Distributed Computing Systems …, 2017 | 19 | 2017 |
| Efficient deterministic leader election for programmable matter F Dufoulon, S Kutten, WK Moses Jr Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing …, 2021 | 12 | 2021 |
| Fast beeping protocols for deterministic MIS and (Δ+ 1)-coloring in sparse graphs J Beauquier, J Burman, F Dufoulon, S Kutten IEEE INFOCOM 2018-IEEE Conference on Computer Communications, 1754-1762, 2018 | 12 | 2018 |
| Distributed MIS in O (log log n) Awake Complexity F Dufoulon, WK Moses Jr, G Pandurangan Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing …, 2023 | 8 | 2023 |
| Optimal multi-broadcast with beeps using group testing J Beauquier, J Burman, P Davies, F Dufoulon Structural Information and Communication Complexity: 26th International …, 2019 | 8 | 2019 |
| Can Uncoordinated Beeps tell Stories? F Dufoulon, J Burman, J Beauquier Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 7 | 2020 |
| Sleeping is superefficient: MIS in exponentially better awake complexity F Dufoulon, WK Moses Jr, G Pandurangan arXiv preprint arXiv:2204.08359, 2022 | 6 | 2022 |
| Brief announcement: Beeping a time-optimal leader election F Dufoulon, J Burman, J Beauquier Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 4 | 2018 |
| Beeping Shortest Paths via Hypergraph Bipartite Decomposition F Dufoulon, Y Emek, R Gelles arXiv preprint arXiv:2210.06882, 2022 | 3 | 2022 |
| An almost singularly optimal asynchronous distributed MST algorithm F Dufoulon, S Kutten, WK Moses Jr, G Pandurangan, D Peleg arXiv preprint arXiv:2210.01173, 2022 | 2 | 2022 |
| Fast Beeping Protocols for Deterministic MIS and ()-Coloring in Sparse Graphs (Extended Version) J Beauquier, J Burman, F Dufoulon, S Kutten LRI, Université Paris-Sud, CNRS, Universitée Paris-Saclay, France; Technion …, 2018 | 2 | 2018 |
| The message complexity of distributed graph optimization F Dufoulon, S Pai, G Pandurangan, SV Pemmaraju, P Robinson arXiv preprint arXiv:2311.14811, 2023 | 1 | 2023 |
| Distributed Coloring in the SLEEPING Model F Dufoulon, P Fraigniaud, M Rabie, H Zheng arXiv preprint arXiv:2405.10058, 2024 | | 2024 |
| Time-and Communication-Efficient Overlay Network Construction via Gossip F Dufoulon, M Moorman, WK Moses Jr, G Pandurangan arXiv preprint arXiv:2311.17115, 2023 | | 2023 |
| Overcoming interference in the beeping communication model F Dufoulon Université Paris Saclay (COmUE), 2019 | | 2019 |
| 32nd International Symposium on Distributed Computing (DISC 2018) SP Fekete, T Goldstein, M Mendler, Y Afek, Y Emek, N Kolikant, S Rafaeli, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |
Shay KuttenProfessor, Technion在 technion.ac.il 的电子邮件经过验证
