38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 1-952, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Proceedings{alistarh:LIPIcs.DISC.2024, title = {{LIPIcs, Volume 319, DISC 2024, Complete Volume}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {1--952}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024}, URN = {urn:nbn:de:0030-drops-220706}, doi = {10.4230/LIPIcs.DISC.2024}, annote = {Keywords: LIPIcs, Volume 319, DISC 2024, Complete Volume} }
38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 0:i-0:xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{alistarh:LIPIcs.DISC.2024.0, author = {Alistarh, Dan}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {0:i--0:xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.0}, URN = {urn:nbn:de:0030-drops-220693}, doi = {10.4230/LIPIcs.DISC.2024.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Eden Aldema Tshuva and Rotem Oshman. Fully Local Succinct Distributed Arguments. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 1:1-1:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{aldematshuva_et_al:LIPIcs.DISC.2024.1, author = {Aldema Tshuva, Eden and Oshman, Rotem}, title = {{Fully Local Succinct Distributed Arguments}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {1:1--1:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.1}, URN = {urn:nbn:de:0030-drops-212662}, doi = {10.4230/LIPIcs.DISC.2024.1}, annote = {Keywords: distributed certification, proof labeling schemes, SNARG} }
Kaya Alpturer, Joseph Y. Halpern, and Ron van der Meyden. A Knowledge-Based Analysis of Intersection Protocols. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{alpturer_et_al:LIPIcs.DISC.2024.2, author = {Alpturer, Kaya and Halpern, Joseph Y. and van der Meyden, Ron}, title = {{A Knowledge-Based Analysis of Intersection Protocols}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.2}, URN = {urn:nbn:de:0030-drops-212291}, doi = {10.4230/LIPIcs.DISC.2024.2}, annote = {Keywords: Intersection management, Autonomous vehicles, Distributed algorithms, Epistemic logic, Fault tolerance} }
John Augustine, Jeffin Biju, Shachar Meir, David Peleg, Srikkanth Ramachandran, and Aishwarya Thiruvengadam. Byzantine Resilient Distributed Computing on External Data. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 3:1-3:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{augustine_et_al:LIPIcs.DISC.2024.3, author = {Augustine, John and Biju, Jeffin and Meir, Shachar and Peleg, David and Ramachandran, Srikkanth and Thiruvengadam, Aishwarya}, title = {{Byzantine Resilient Distributed Computing on External Data}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {3:1--3:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.3}, URN = {urn:nbn:de:0030-drops-212304}, doi = {10.4230/LIPIcs.DISC.2024.3}, annote = {Keywords: Byzantine Fault Tolerance, Blockchain Oracle, Congested Clique, Data Retrieval Model} }
Sirui Bai, Xinyu Fu, Xudong Wu, Penghui Yao, and Chaodong Zheng. Almost Optimal Algorithms for Token Collision in Anonymous Networks. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 4:1-4:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bai_et_al:LIPIcs.DISC.2024.4, author = {Bai, Sirui and Fu, Xinyu and Wu, Xudong and Yao, Penghui and Zheng, Chaodong}, title = {{Almost Optimal Algorithms for Token Collision in Anonymous Networks}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {4:1--4:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.4}, URN = {urn:nbn:de:0030-drops-212319}, doi = {10.4230/LIPIcs.DISC.2024.4}, annote = {Keywords: Token collision, anonymous networks, deterministic algorithms} }
Alkida Balliu, Pierre Fraigniaud, Patrick Lambein-Monette, Dennis Olivetti, and Mikaël Rabie. Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{balliu_et_al:LIPIcs.DISC.2024.5, author = {Balliu, Alkida and Fraigniaud, Pierre and Lambein-Monette, Patrick and Olivetti, Dennis and Rabie, Mika\"{e}l}, title = {{Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {5:1--5:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.5}, URN = {urn:nbn:de:0030-drops-212328}, doi = {10.4230/LIPIcs.DISC.2024.5}, annote = {Keywords: LOCAL model, Graph Coloring, Renaming, Weak Symmetry-Breaking, Fault-Tolerance, Wait-Free Computing} }
Leonid Barenboim and Uri Goldenberg. Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 6:1-6:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{barenboim_et_al:LIPIcs.DISC.2024.6, author = {Barenboim, Leonid and Goldenberg, Uri}, title = {{Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {6:1--6:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.6}, URN = {urn:nbn:de:0030-drops-212337}, doi = {10.4230/LIPIcs.DISC.2024.6}, annote = {Keywords: Distributed Algorithms, Graph Coloring, Power Graph, CONGEST} }
Benyamin Bashari, David Yu Cheng Chan, and Philipp Woelfel. A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 7:1-7:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bashari_et_al:LIPIcs.DISC.2024.7, author = {Bashari, Benyamin and Chan, David Yu Cheng and Woelfel, Philipp}, title = {{A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {7:1--7:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.7}, URN = {urn:nbn:de:0030-drops-212342}, doi = {10.4230/LIPIcs.DISC.2024.7}, annote = {Keywords: Shared memory, snapshot, camera object, RMW, distributed computing} }
Yoav Ben Shimon, Ori Lahav, and Sharon Shoham. Hyperproperty-Preserving Register Specifications. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 8:1-8:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{benshimon_et_al:LIPIcs.DISC.2024.8, author = {Ben Shimon, Yoav and Lahav, Ori and Shoham, Sharon}, title = {{Hyperproperty-Preserving Register Specifications}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {8:1--8:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.8}, URN = {urn:nbn:de:0030-drops-212630}, doi = {10.4230/LIPIcs.DISC.2024.8}, annote = {Keywords: Hyperproperties, Concurrent objects, Distributed objects, Linearizability, Strong linearizability, Simulation} }
Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, and Nicolas Hanusse. Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bonichon_et_al:LIPIcs.DISC.2024.9, author = {Bonichon, Nicolas and Casteigts, Arnaud and Gavoille, Cyril and Hanusse, Nicolas}, title = {{Freeze-Tag in L₁ Has Wake-Up Time Five with Linear Complexity}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.9}, URN = {urn:nbn:de:0030-drops-212356}, doi = {10.4230/LIPIcs.DISC.2024.9}, annote = {Keywords: freeze-tag problem, metric, algorithm} }
Manuel Bravo, Gregory Chockler, Alexey Gotsman, Alejandro Naser-Pastoriza, and Christian Roldán. Vertical Atomic Broadcast and Passive Replication. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 10:1-10:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bravo_et_al:LIPIcs.DISC.2024.10, author = {Bravo, Manuel and Chockler, Gregory and Gotsman, Alexey and Naser-Pastoriza, Alejandro and Rold\'{a}n, Christian}, title = {{Vertical Atomic Broadcast and Passive Replication}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {10:1--10:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.10}, URN = {urn:nbn:de:0030-drops-212363}, doi = {10.4230/LIPIcs.DISC.2024.10}, annote = {Keywords: Reconfiguration, consensus, replication} }
Armando Castañeda, Gregory Chockler, Brijesh Dongol, and Ori Lahav. What Cannot Be Implemented on Weak Memory?. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 11:1-11:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{castaneda_et_al:LIPIcs.DISC.2024.11, author = {Casta\~{n}eda, Armando and Chockler, Gregory and Dongol, Brijesh and Lahav, Ori}, title = {{What Cannot Be Implemented on Weak Memory?}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {11:1--11:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.11}, URN = {urn:nbn:de:0030-drops-212371}, doi = {10.4230/LIPIcs.DISC.2024.11}, annote = {Keywords: Impossibility, Weak Memory Models, Total-Store Order, Release-Acquire} }
Keren Censor-Hillel, Tomer Even, and Virginia Vassilevska Williams. Faster Cycle Detection in the Congested Clique. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 12:1-12:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{censorhillel_et_al:LIPIcs.DISC.2024.12, author = {Censor-Hillel, Keren and Even, Tomer and Vassilevska Williams, Virginia}, title = {{Faster Cycle Detection in the Congested Clique}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {12:1--12:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.12}, URN = {urn:nbn:de:0030-drops-212382}, doi = {10.4230/LIPIcs.DISC.2024.12}, annote = {Keywords: triangle detection, cycle detection, distributed computing, Congested Clique, quantum computing, Fast matrix multiplication, Fast rectangular matrix multiplication} }
Jérémie Chalopin, Shantanu Das, and Maria Kokkou. Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chalopin_et_al:LIPIcs.DISC.2024.13, author = {Chalopin, J\'{e}r\'{e}mie and Das, Shantanu and Kokkou, Maria}, title = {{Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {13:1--13:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.13}, URN = {urn:nbn:de:0030-drops-212395}, doi = {10.4230/LIPIcs.DISC.2024.13}, annote = {Keywords: Leader Election, Programmable Matter, Self-Stabilisation, Silent, Deterministic, Unique Leader, Simply Connected, Gouda fair Daemon, Constant Memory} }
Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Rachid Guerraoui, Jovan Komatovic, Manuel Vidigueira, and Igor Zablotchi. Efficient Signature-Free Validated Agreement. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 14:1-14:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{civit_et_al:LIPIcs.DISC.2024.14, author = {Civit, Pierre and Dzulfikar, Muhammad Ayaz and Gilbert, Seth and Guerraoui, Rachid and Komatovic, Jovan and Vidigueira, Manuel and Zablotchi, Igor}, title = {{Efficient Signature-Free Validated Agreement}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {14:1--14:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.14}, URN = {urn:nbn:de:0030-drops-212408}, doi = {10.4230/LIPIcs.DISC.2024.14}, annote = {Keywords: Validated Byzantine agreement, Bit complexity, Round complexity} }
Andrei Constantinescu, Diana Ghinea, Roger Wattenhofer, and Floris Westermann. Convex Consensus with Asynchronous Fallback. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 15:1-15:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{constantinescu_et_al:LIPIcs.DISC.2024.15, author = {Constantinescu, Andrei and Ghinea, Diana and Wattenhofer, Roger and Westermann, Floris}, title = {{Convex Consensus with Asynchronous Fallback}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {15:1--15:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.15}, URN = {urn:nbn:de:0030-drops-212411}, doi = {10.4230/LIPIcs.DISC.2024.15}, annote = {Keywords: convex consensus, network-agnostic protocols, agreement on a core-set} }
Yannis Coutouly and Emmanuel Godard. A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 16:1-16:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{coutouly_et_al:LIPIcs.DISC.2024.16, author = {Coutouly, Yannis and Godard, Emmanuel}, title = {{A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {16:1--16:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.16}, URN = {urn:nbn:de:0030-drops-212422}, doi = {10.4230/LIPIcs.DISC.2024.16}, annote = {Keywords: topological methods, geometric simplicial complex, set-agreement} }
Philipp Czerner. Breaking Through the Ω(n)-Space Barrier: Population Protocols Decide Double-Exponential Thresholds. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 17:1-17:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{czerner:LIPIcs.DISC.2024.17, author = {Czerner, Philipp}, title = {{Breaking Through the \Omega(n)-Space Barrier: Population Protocols Decide Double-Exponential Thresholds}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {17:1--17:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.17}, URN = {urn:nbn:de:0030-drops-212438}, doi = {10.4230/LIPIcs.DISC.2024.17}, annote = {Keywords: Distributed computing, population protocols, state complexity} }
Niccolò D'Archivio and Robin Vacus. On the Limits of Information Spread by Memory-Less Agents. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 18:1-18:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{darchivio_et_al:LIPIcs.DISC.2024.18, author = {D'Archivio, Niccol\`{o} and Vacus, Robin}, title = {{On the Limits of Information Spread by Memory-Less Agents}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {18:1--18:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.18}, URN = {urn:nbn:de:0030-drops-212441}, doi = {10.4230/LIPIcs.DISC.2024.18}, annote = {Keywords: Opinion Dynamics, Consensus Protocols, Collective Animal Behavior, Lower Bound} }
Laxman Dhulipala, Michael Dinitz, Jakub Łącki, and Slobodan Mitrović. Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 19:1-19:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dhulipala_et_al:LIPIcs.DISC.2024.19, author = {Dhulipala, Laxman and Dinitz, Michael and {\L}\k{a}cki, Jakub and Mitrovi\'{c}, Slobodan}, title = {{Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {19:1--19:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.19}, URN = {urn:nbn:de:0030-drops-212453}, doi = {10.4230/LIPIcs.DISC.2024.19}, annote = {Keywords: approximate maximum matching, set cover, hypergraph matching, PRAM, massively parallel computation} }
David Doty and Ben Heckmann. The Computational Power of Discrete Chemical Reaction Networks with Bounded Executions. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 20:1-20:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{doty_et_al:LIPIcs.DISC.2024.20, author = {Doty, David and Heckmann, Ben}, title = {{The Computational Power of Discrete Chemical Reaction Networks with Bounded Executions}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {20:1--20:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.20}, URN = {urn:nbn:de:0030-drops-212469}, doi = {10.4230/LIPIcs.DISC.2024.20}, annote = {Keywords: chemical reaction networks, population protocols, stable computation} }
Antoine El-Hayek, Monika Henzinger, and Stefan Schmid. Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 21:1-21:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{elhayek_et_al:LIPIcs.DISC.2024.21, author = {El-Hayek, Antoine and Henzinger, Monika and Schmid, Stefan}, title = {{Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.21}, URN = {urn:nbn:de:0030-drops-212476}, doi = {10.4230/LIPIcs.DISC.2024.21}, annote = {Keywords: Broadcast, Smoothed Analysis, Stochastic Networks, Dynamic Networks} }
Yuval Emek, Yuval Gil, and Noga Harlev. On the Power of Graphical Reconfigurable Circuits. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{emek_et_al:LIPIcs.DISC.2024.22, author = {Emek, Yuval and Gil, Yuval and Harlev, Noga}, title = {{On the Power of Graphical Reconfigurable Circuits}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.22}, URN = {urn:nbn:de:0030-drops-212487}, doi = {10.4230/LIPIcs.DISC.2024.22}, annote = {Keywords: graphical reconfigurable circuits, bounded uniformity, beeping} }
Panagiota Fatourou and Eric Ruppert. Lock-Free Augmented Trees. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 23:1-23:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fatourou_et_al:LIPIcs.DISC.2024.23, author = {Fatourou, Panagiota and Ruppert, Eric}, title = {{Lock-Free Augmented Trees}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {23:1--23:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.23}, URN = {urn:nbn:de:0030-drops-212499}, doi = {10.4230/LIPIcs.DISC.2024.23}, annote = {Keywords: shared-memory, data structure, tree, binary search tree, augmentation, linearizable, lock-free, order statistic, snapshot} }
Maxime Flin, Magnús M. Halldórsson, and Alexandre Nolin. Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 24:1-24:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{flin_et_al:LIPIcs.DISC.2024.24, author = {Flin, Maxime and Halld\'{o}rsson, Magn\'{u}s M. and Nolin, Alexandre}, title = {{Decentralized Distributed Graph Coloring II: Degree+1-Coloring Virtual Graphs}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {24:1--24:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.24}, URN = {urn:nbn:de:0030-drops-212502}, doi = {10.4230/LIPIcs.DISC.2024.24}, annote = {Keywords: Graph Coloring, Distributed Algorithms, Virtual Graphs, Congestion, Dilation} }
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, and Ioan Todinca. Distributed Model Checking on Graphs of Bounded Treedepth. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 25:1-25:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fomin_et_al:LIPIcs.DISC.2024.25, author = {Fomin, Fedor V. and Fraigniaud, Pierre and Montealegre, Pedro and Rapaport, Ivan and Todinca, Ioan}, title = {{Distributed Model Checking on Graphs of Bounded Treedepth}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {25:1--25:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.25}, URN = {urn:nbn:de:0030-drops-212513}, doi = {10.4230/LIPIcs.DISC.2024.25}, annote = {Keywords: proof-labeling schemes, local computing, CONGEST model} }
Fabian Frei, Ran Gelles, Ahmed Ghazy, and Alexandre Nolin. Content-Oblivious Leader Election on Rings. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 26:1-26:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{frei_et_al:LIPIcs.DISC.2024.26, author = {Frei, Fabian and Gelles, Ran and Ghazy, Ahmed and Nolin, Alexandre}, title = {{Content-Oblivious Leader Election on Rings}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {26:1--26:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.26}, URN = {urn:nbn:de:0030-drops-212527}, doi = {10.4230/LIPIcs.DISC.2024.26}, annote = {Keywords: Content-Oblivious Computation, Faulty Communication, Leader Election, Ring Networks, Ring Orientation} }
Ran Gelles, Zvi Lotker, and Frederik Mallmann-Trenn. Sorting in One and Two Rounds Using t-Comparators. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 27:1-27:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{gelles_et_al:LIPIcs.DISC.2024.27, author = {Gelles, Ran and Lotker, Zvi and Mallmann-Trenn, Frederik}, title = {{Sorting in One and Two Rounds Using t-Comparators}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {27:1--27:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.27}, URN = {urn:nbn:de:0030-drops-212539}, doi = {10.4230/LIPIcs.DISC.2024.27}, annote = {Keywords: Sorting, Steiner-System, Round Complexity, Deferred Randomness} }
George Giakkoupis, Volker Turau, and Isabella Ziccardi. Self-Stabilizing MIS Computation in the Beeping Model. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 28:1-28:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{giakkoupis_et_al:LIPIcs.DISC.2024.28, author = {Giakkoupis, George and Turau, Volker and Ziccardi, Isabella}, title = {{Self-Stabilizing MIS Computation in the Beeping Model}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {28:1--28:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.28}, URN = {urn:nbn:de:0030-drops-212540}, doi = {10.4230/LIPIcs.DISC.2024.28}, annote = {Keywords: Maximal Independent Set, Self-Stabilization, Beeping Model} }
Jeff Giliberti and Zahra Parsaeian. Massively Parallel Ruling Set Made Deterministic. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 29:1-29:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{giliberti_et_al:LIPIcs.DISC.2024.29, author = {Giliberti, Jeff and Parsaeian, Zahra}, title = {{Massively Parallel Ruling Set Made Deterministic}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {29:1--29:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.29}, URN = {urn:nbn:de:0030-drops-212551}, doi = {10.4230/LIPIcs.DISC.2024.29}, annote = {Keywords: deterministic algorithms, distributed computing, massively parallel computation, graph algorithms, derandomization} }
Neil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, and Ling Ren. Granular Synchrony. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 30:1-30:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{giridharan_et_al:LIPIcs.DISC.2024.30, author = {Giridharan, Neil and Abraham, Ittai and Crooks, Natacha and Nayak, Kartik and Ren, Ling}, title = {{Granular Synchrony}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {30:1--30:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.30}, URN = {urn:nbn:de:0030-drops-212566}, doi = {10.4230/LIPIcs.DISC.2024.30}, annote = {Keywords: Timing model, synchrony, asynchrony, consensus, blockchain, fault tolerance} }
Magnús M. Halldórsson and Yannic Maus. Distributed Delta-Coloring Under Bandwidth Limitations. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 31:1-31:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{halldorsson_et_al:LIPIcs.DISC.2024.31, author = {Halld\'{o}rsson, Magn\'{u}s M. and Maus, Yannic}, title = {{Distributed Delta-Coloring Under Bandwidth Limitations}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {31:1--31:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.31}, URN = {urn:nbn:de:0030-drops-212572}, doi = {10.4230/LIPIcs.DISC.2024.31}, annote = {Keywords: Graph problems, Graph coloring, Lov\'{a}sz local lemma, LOCAL model, CONGEST model, Distributed computing} }
Longcheng Li, Xiaoming Sun, and Jiadong Zhu. Quantum Byzantine Agreement Against Full-Information Adversary. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 32:1-32:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{li_et_al:LIPIcs.DISC.2024.32, author = {Li, Longcheng and Sun, Xiaoming and Zhu, Jiadong}, title = {{Quantum Byzantine Agreement Against Full-Information Adversary}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {32:1--32:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.32}, URN = {urn:nbn:de:0030-drops-212582}, doi = {10.4230/LIPIcs.DISC.2024.32}, annote = {Keywords: Byzantine agreement, Quantum computation, Full-information model} }
Raïssa Nataf and Yoram Moses. Communication Requirements for Linearizable Registers. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 33:1-33:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{nataf_et_al:LIPIcs.DISC.2024.33, author = {Nataf, Ra\"{i}ssa and Moses, Yoram}, title = {{Communication Requirements for Linearizable Registers}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {33:1--33:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.33}, URN = {urn:nbn:de:0030-drops-212593}, doi = {10.4230/LIPIcs.DISC.2024.33}, annote = {Keywords: linearizability, atomic registers, asynchrony, message chains, real time} }
Shunhao Oh, Joseph L. Briones, Jacob Calvert, Noah Egan, Dana Randall, and Andréa W. Richa. Single Bridge Formation in Self-Organizing Particle Systems. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 34:1-34:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{oh_et_al:LIPIcs.DISC.2024.34, author = {Oh, Shunhao and Briones, Joseph L. and Calvert, Jacob and Egan, Noah and Randall, Dana and Richa, Andr\'{e}a W.}, title = {{Single Bridge Formation in Self-Organizing Particle Systems}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {34:1--34:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.34}, URN = {urn:nbn:de:0030-drops-212606}, doi = {10.4230/LIPIcs.DISC.2024.34}, annote = {Keywords: Self-organizing particle systems, programmable matter, bridging, jump chain} }
Garrett Parzych and Joshua J. Daymude. Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 35:1-35:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{parzych_et_al:LIPIcs.DISC.2024.35, author = {Parzych, Garrett and Daymude, Joshua J.}, title = {{Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {35:1--35:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.35}, URN = {urn:nbn:de:0030-drops-212615}, doi = {10.4230/LIPIcs.DISC.2024.35}, annote = {Keywords: Dynamic networks, anonymity, broadcast, space complexity, lower bounds, termination detection, stabilizing termination} }
Asaf Petruschka, Shay Spair, and Elad Tzalik. Connectivity Labeling in Faulty Colored Graphs. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 36:1-36:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{petruschka_et_al:LIPIcs.DISC.2024.36, author = {Petruschka, Asaf and Spair, Shay and Tzalik, Elad}, title = {{Connectivity Labeling in Faulty Colored Graphs}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {36:1--36:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.36}, URN = {urn:nbn:de:0030-drops-212622}, doi = {10.4230/LIPIcs.DISC.2024.36}, annote = {Keywords: Labeling schemes, Fault-tolerance} }
Victor Shoup. Sing a Song of Simplex. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 37:1-37:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{shoup:LIPIcs.DISC.2024.37, author = {Shoup, Victor}, title = {{Sing a Song of Simplex}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {37:1--37:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.37}, URN = {urn:nbn:de:0030-drops-212649}, doi = {10.4230/LIPIcs.DISC.2024.37}, annote = {Keywords: Consensus, Atomic broadcast, Blockchain} }
Yuichi Sudo, Masahiro Shibata, Junya Nakamura, Yonghwan Kim, and Toshimitsu Masuzawa. Near-Linear Time Dispersion of Mobile Agents. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 38:1-38:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{sudo_et_al:LIPIcs.DISC.2024.38, author = {Sudo, Yuichi and Shibata, Masahiro and Nakamura, Junya and Kim, Yonghwan and Masuzawa, Toshimitsu}, title = {{Near-Linear Time Dispersion of Mobile Agents}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {38:1--38:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.38}, URN = {urn:nbn:de:0030-drops-212658}, doi = {10.4230/LIPIcs.DISC.2024.38}, annote = {Keywords: mobile agents, autonomous robots, dispersion} }
Qinzi Zhang and Lewis Tseng. The Power of Abstract MAC Layer: A Fault-Tolerance Perspective. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 39:1-39:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{zhang_et_al:LIPIcs.DISC.2024.39, author = {Zhang, Qinzi and Tseng, Lewis}, title = {{The Power of Abstract MAC Layer: A Fault-Tolerance Perspective}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {39:1--39:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.39}, URN = {urn:nbn:de:0030-drops-212677}, doi = {10.4230/LIPIcs.DISC.2024.39}, annote = {Keywords: Abstract MAC Layer, Computation Power, Consensus} }
Yaseen Abd-Elhaleem, Michal Dory, Merav Parter, and Oren Weimann. Brief Announcement: Distributed Maximum Flow in Planar Graphs. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 40:1-40:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{abdelhaleem_et_al:LIPIcs.DISC.2024.40, author = {Abd-Elhaleem, Yaseen and Dory, Michal and Parter, Merav and Weimann, Oren}, title = {{Brief Announcement: Distributed Maximum Flow in Planar Graphs}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {40:1--40:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.40}, URN = {urn:nbn:de:0030-drops-212687}, doi = {10.4230/LIPIcs.DISC.2024.40}, annote = {Keywords: Maximum flow, shortest paths, planar graphs, distributed computing} }
Timothé Albouy, Davide Frey, Ran Gelles, Carmit Hazay, Michel Raynal, Elad Michael Schiller, François Taïani, and Vassilis Zikas. Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 41:1-41:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{albouy_et_al:LIPIcs.DISC.2024.41, author = {Albouy, Timoth\'{e} and Frey, Davide and Gelles, Ran and Hazay, Carmit and Raynal, Michel and Schiller, Elad Michael and Ta\"{i}ani, Fran\c{c}ois and Zikas, Vassilis}, title = {{Brief Announcement: Towards Optimal Communication Byzantine Reliable Broadcast Under a Message Adversary}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {41:1--41:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.41}, URN = {urn:nbn:de:0030-drops-212697}, doi = {10.4230/LIPIcs.DISC.2024.41}, annote = {Keywords: Asynchronous message-passing, Byzantine fault-tolerance, Message adversary, Reliable Broadcast} }
Hagit Attiya, Pierre Fraigniaud, Ami Paz, and Sergio Rajsbaum. Brief Announcement: Solvability of Three-Process General Tasks. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 42:1-42:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{attiya_et_al:LIPIcs.DISC.2024.42, author = {Attiya, Hagit and Fraigniaud, Pierre and Paz, Ami and Rajsbaum, Sergio}, title = {{Brief Announcement: Solvability of Three-Process General Tasks}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {42:1--42:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.42}, URN = {urn:nbn:de:0030-drops-212700}, doi = {10.4230/LIPIcs.DISC.2024.42}, annote = {Keywords: Wait-free computing, lower bounds, topology} }
Andrei Constantinescu, Diana Ghinea, Jakub Sliwinski, and Roger Wattenhofer. Brief Announcement: Unifying Partial Synchrony. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 43:1-43:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{constantinescu_et_al:LIPIcs.DISC.2024.43, author = {Constantinescu, Andrei and Ghinea, Diana and Sliwinski, Jakub and Wattenhofer, Roger}, title = {{Brief Announcement: Unifying Partial Synchrony}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {43:1--43:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.43}, URN = {urn:nbn:de:0030-drops-212717}, doi = {10.4230/LIPIcs.DISC.2024.43}, annote = {Keywords: partial synchrony, unknown latency, global stabilization time} }
Philipp Czerner, Vincent Fischer, and Roland Guttenberg. Brief Announcement: The Expressive Power of Uniform Population Protocols with Logarithmic Space. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 44:1-44:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{czerner_et_al:LIPIcs.DISC.2024.44, author = {Czerner, Philipp and Fischer, Vincent and Guttenberg, Roland}, title = {{Brief Announcement: The Expressive Power of Uniform Population Protocols with Logarithmic Space}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {44:1--44:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.44}, URN = {urn:nbn:de:0030-drops-212726}, doi = {10.4230/LIPIcs.DISC.2024.44}, annote = {Keywords: Population Protocols, Uniform, Expressive Power} }
Lei Fan, Jonathan Katz, Zhenghao Lu, Phuc Thai, and Hong-Sheng Zhou. Brief Announcement: Best-Possible Unpredictable Proof-Of-Stake. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 45:1-45:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fan_et_al:LIPIcs.DISC.2024.45, author = {Fan, Lei and Katz, Jonathan and Lu, Zhenghao and Thai, Phuc and Zhou, Hong-Sheng}, title = {{Brief Announcement: Best-Possible Unpredictable Proof-Of-Stake}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {45:1--45:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.45}, URN = {urn:nbn:de:0030-drops-212731}, doi = {10.4230/LIPIcs.DISC.2024.45}, annote = {Keywords: blockchain, consensus, proof-of-stake, unpredictability} }
Caterina Feletti, Debasish Pattanayak, and Gokarna Sharma. Brief Announcement: Optimal Uniform Circle Formation by Asynchronous Luminous Robots. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 46:1-46:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{feletti_et_al:LIPIcs.DISC.2024.46, author = {Feletti, Caterina and Pattanayak, Debasish and Sharma, Gokarna}, title = {{Brief Announcement: Optimal Uniform Circle Formation by Asynchronous Luminous Robots}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {46:1--46:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.46}, URN = {urn:nbn:de:0030-drops-212748}, doi = {10.4230/LIPIcs.DISC.2024.46}, annote = {Keywords: Uniform Circle Formation, Robots with Lights, Autonomous Robots, Rank Encoding, Time and Color Complexities, Computational SEC} }
Pierre Fraigniaud, Minh Hang Nguyen, and Ami Paz. Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 47:1-47:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{fraigniaud_et_al:LIPIcs.DISC.2024.47, author = {Fraigniaud, Pierre and Nguyen, Minh Hang and Paz, Ami}, title = {{Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {47:1--47:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.47}, URN = {urn:nbn:de:0030-drops-212755}, doi = {10.4230/LIPIcs.DISC.2024.47}, annote = {Keywords: Consensus, set-agreement, fault tolerance, crash failures} }
Fabian Frei and Koichi Wada. Brief Announcement: Distinct Gathering Under Round Robin. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 48:1-48:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{frei_et_al:LIPIcs.DISC.2024.48, author = {Frei, Fabian and Wada, Koichi}, title = {{Brief Announcement: Distinct Gathering Under Round Robin}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {48:1--48:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.48}, URN = {urn:nbn:de:0030-drops-212768}, doi = {10.4230/LIPIcs.DISC.2024.48}, annote = {Keywords: Autonomous mobile robots, Distinct Gathering, Round Robin} }
Jan Matyáš Křišťan and Josef Erik Sedláček. Brief Announcement: Decreasing Verification Radius in Local Certification. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 49:1-49:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kristan_et_al:LIPIcs.DISC.2024.49, author = {K\v{r}i\v{s}\v{t}an, Jan Maty\'{a}\v{s} and Sedl\'{a}\v{c}ek, Josef Erik}, title = {{Brief Announcement: Decreasing Verification Radius in Local Certification}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {49:1--49:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.49}, URN = {urn:nbn:de:0030-drops-212773}, doi = {10.4230/LIPIcs.DISC.2024.49}, annote = {Keywords: Local certification, locally checkable proofs, proof-labeling schemes, graphs, distributed computing} }
Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, and Gokarna Sharma. Brief Announcement: Agent-Based Leader Election, MST, and Beyond. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 50:1-50:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{kshemkalyani_et_al:LIPIcs.DISC.2024.50, author = {Kshemkalyani, Ajay D. and Kumar, Manish and Molla, Anisur Rahaman and Sharma, Gokarna}, title = {{Brief Announcement: Agent-Based Leader Election, MST, and Beyond}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {50:1--50:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.50}, URN = {urn:nbn:de:0030-drops-212782}, doi = {10.4230/LIPIcs.DISC.2024.50}, annote = {Keywords: Distributed algorithms, mobile agents, local communication, leader election, MST, MIS, gathering, minimal dominating sets, time and memory complexity, graph parameters} }
Christoph Lenzen and Shreyas Srinivas. Brief Announcement: Clock Distribution with Gradient TRIX. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 51:1-51:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{lenzen_et_al:LIPIcs.DISC.2024.51, author = {Lenzen, Christoph and Srinivas, Shreyas}, title = {{Brief Announcement: Clock Distribution with Gradient TRIX}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {51:1--51:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.51}, URN = {urn:nbn:de:0030-drops-212791}, doi = {10.4230/LIPIcs.DISC.2024.51}, annote = {Keywords: local skew, gradient clock synchronisation, average-case fault-tolerance, self-stabilisation, Systems-on-Chip} }
Xiao Li and Mohsen Lesani. Brief Announcement: Reconfigurable Heterogeneous Quorum Systems. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 52:1-52:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{li_et_al:LIPIcs.DISC.2024.52, author = {Li, Xiao and Lesani, Mohsen}, title = {{Brief Announcement: Reconfigurable Heterogeneous Quorum Systems}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {52:1--52:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.52}, URN = {urn:nbn:de:0030-drops-212804}, doi = {10.4230/LIPIcs.DISC.2024.52}, annote = {Keywords: Quorum Systems, Reconfiguration, Heterogeneity} }
Gal Sela and Erez Petrank. Brief Announcement: Concurrent Aggregate Queries. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 53:1-53:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{sela_et_al:LIPIcs.DISC.2024.53, author = {Sela, Gal and Petrank, Erez}, title = {{Brief Announcement: Concurrent Aggregate Queries}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {53:1--53:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.53}, URN = {urn:nbn:de:0030-drops-212819}, doi = {10.4230/LIPIcs.DISC.2024.53}, annote = {Keywords: Concurrent Algorithms, Concurrent Data Structures, Aggregate queries, Range queries, Binary Search Tree, Linearizability} }
Yusong Shi and Weidong Liu. Brief Announcement: Colorless Tasks and Extension-Based Proofs. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 54:1-54:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{shi_et_al:LIPIcs.DISC.2024.54, author = {Shi, Yusong and Liu, Weidong}, title = {{Brief Announcement: Colorless Tasks and Extension-Based Proofs}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {54:1--54:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.54}, URN = {urn:nbn:de:0030-drops-212821}, doi = {10.4230/LIPIcs.DISC.2024.54}, annote = {Keywords: Colorless tasks, Impossibility proofs, Extension-based proof} }
Yuichi Sudo, Fukuhito Ooshita, and Sayaka Kamei. Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent. In 38th International Symposium on Distributed Computing (DISC 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 319, pp. 55:1-55:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{sudo_et_al:LIPIcs.DISC.2024.55, author = {Sudo, Yuichi and Ooshita, Fukuhito and Kamei, Sayaka}, title = {{Brief Announcement: Self-Stabilizing Graph Exploration by a Single Agent}}, booktitle = {38th International Symposium on Distributed Computing (DISC 2024)}, pages = {55:1--55:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-352-2}, ISSN = {1868-8969}, year = {2024}, volume = {319}, editor = {Alistarh, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2024.55}, URN = {urn:nbn:de:0030-drops-212832}, doi = {10.4230/LIPIcs.DISC.2024.55}, annote = {Keywords: mobile agents, self-stabilization, graph exploration} }
Feedback for Dagstuhl Publishing