Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, and Peter Robinson. The Message Complexity of Distributed Graph Optimization. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 41:1-41:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dufoulon_et_al:LIPIcs.ITCS.2024.41, author = {Dufoulon, Fabien and Pai, Shreyas and Pandurangan, Gopal and Pemmaraju, Sriram V. and Robinson, Peter}, title = {{The Message Complexity of Distributed Graph Optimization}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {41:1--41:26}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.41}, URN = {urn:nbn:de:0030-drops-195690}, doi = {10.4230/LIPIcs.ITCS.2024.41}, annote = {Keywords: Distributed graph algorithm, message complexity, distributed approximation} }
Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Fabien Dufoulon, Michael Moorman, William K. Moses Jr., and Gopal Pandurangan. Time- and Communication-Efficient Overlay Network Construction via Gossip. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 42:1-42:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dufoulon_et_al:LIPIcs.ITCS.2024.42, author = {Dufoulon, Fabien and Moorman, Michael and Moses Jr., William K. and Pandurangan, Gopal}, title = {{Time- and Communication-Efficient Overlay Network Construction via Gossip}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {42:1--42:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.42}, URN = {urn:nbn:de:0030-drops-195700}, doi = {10.4230/LIPIcs.ITCS.2024.42}, annote = {Keywords: Peer-to-Peer Networks, Overlay Construction Protocol, Gossip, Expanders, Sublinear Bounds} }
Published in: LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Fabien Dufoulon, Yuval Emek, and Ran Gelles. Beeping Shortest Paths via Hypergraph Bipartite Decomposition. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 45:1-45:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{dufoulon_et_al:LIPIcs.ITCS.2023.45, author = {Dufoulon, Fabien and Emek, Yuval and Gelles, Ran}, title = {{Beeping Shortest Paths via Hypergraph Bipartite Decomposition}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {45:1--45:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-263-1}, ISSN = {1868-8969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.45}, URN = {urn:nbn:de:0030-drops-175485}, doi = {10.4230/LIPIcs.ITCS.2023.45}, annote = {Keywords: Beeping Networks, Shortest Paths, Hypergraph Bipartite Decomposition} }
Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, and David Peleg. An Almost Singularly Optimal Asynchronous Distributed MST Algorithm. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 19:1-19:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dufoulon_et_al:LIPIcs.DISC.2022.19, author = {Dufoulon, Fabien and Kutten, Shay and Moses Jr., William K. and Pandurangan, Gopal and Peleg, David}, title = {{An Almost Singularly Optimal Asynchronous Distributed MST Algorithm}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {19:1--19:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.19}, URN = {urn:nbn:de:0030-drops-172107}, doi = {10.4230/LIPIcs.DISC.2022.19}, annote = {Keywords: Asynchronous networks, Minimum Spanning Tree, Distributed Algorithm, Singularly Optimal} }
Published in: LIPIcs, Volume 121, 32nd International Symposium on Distributed Computing (DISC 2018)
Fabien Dufoulon, Janna Burman, and Joffroy Beauquier. Beeping a Deterministic Time-Optimal Leader Election. In 32nd International Symposium on Distributed Computing (DISC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 121, pp. 20:1-20:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dufoulon_et_al:LIPIcs.DISC.2018.20, author = {Dufoulon, Fabien and Burman, Janna and Beauquier, Joffroy}, title = {{Beeping a Deterministic Time-Optimal Leader Election}}, booktitle = {32nd International Symposium on Distributed Computing (DISC 2018)}, pages = {20:1--20:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-092-7}, ISSN = {1868-8969}, year = {2018}, volume = {121}, editor = {Schmid, Ulrich and Widder, Josef}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2018.20}, URN = {urn:nbn:de:0030-drops-98090}, doi = {10.4230/LIPIcs.DISC.2018.20}, annote = {Keywords: distributed algorithms, leader election, beeping model, time complexity, deterministic algorithms, wireless networks} }
Feedback for Dagstuhl Publishing