34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 1-768, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@Proceedings{attiya:LIPIcs.DISC.2020, title = {{LIPIcs, Volume 179, DISC 2020, Complete Volume}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {1--768}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020}, URN = {urn:nbn:de:0030-drops-130777}, doi = {10.4230/LIPIcs.DISC.2020}, annote = {Keywords: LIPIcs, Volume 179, DISC 2020, Complete Volume} }
34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{attiya:LIPIcs.DISC.2020.0, author = {Attiya, Hagit}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.0}, URN = {urn:nbn:de:0030-drops-130787}, doi = {10.4230/LIPIcs.DISC.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Sepehr Assadi, Aaron Bernstein, and Zachary Langley. Improved Bounds for Distributed Load Balancing. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{assadi_et_al:LIPIcs.DISC.2020.1, author = {Assadi, Sepehr and Bernstein, Aaron and Langley, Zachary}, title = {{Improved Bounds for Distributed Load Balancing}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {1:1--1:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.1}, URN = {urn:nbn:de:0030-drops-130798}, doi = {10.4230/LIPIcs.DISC.2020.1}, annote = {Keywords: Load Balancing, Distributed Algorithms, Matching, Semi-Matching} }
Arik Rinberg and Idit Keidar. Intermediate Value Linearizability: A Quantitative Correctness Criterion. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{rinberg_et_al:LIPIcs.DISC.2020.2, author = {Rinberg, Arik and Keidar, Idit}, title = {{Intermediate Value Linearizability: A Quantitative Correctness Criterion}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.2}, URN = {urn:nbn:de:0030-drops-130801}, doi = {10.4230/LIPIcs.DISC.2020.2}, annote = {Keywords: concurrency, concurrent objects, linearizability} }
Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami. The Splay-List: A Distribution-Adaptive Concurrent Skip-List. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 3:1-3:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{aksenov_et_al:LIPIcs.DISC.2020.3, author = {Aksenov, Vitaly and Alistarh, Dan and Drozdova, Alexandra and Mohtashami, Amirkeivan}, title = {{The Splay-List: A Distribution-Adaptive Concurrent Skip-List}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {3:1--3:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.3}, URN = {urn:nbn:de:0030-drops-130818}, doi = {10.4230/LIPIcs.DISC.2020.3}, annote = {Keywords: Data structures, self-adjusting, concurrency} }
Rachid Guerraoui, Alex Kogan, Virendra J. Marathe, and Igor Zablotchi. Efficient Multi-Word Compare and Swap. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{guerraoui_et_al:LIPIcs.DISC.2020.4, author = {Guerraoui, Rachid and Kogan, Alex and Marathe, Virendra J. and Zablotchi, Igor}, title = {{Efficient Multi-Word Compare and Swap}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {4:1--4:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.4}, URN = {urn:nbn:de:0030-drops-130827}, doi = {10.4230/LIPIcs.DISC.2020.4}, annote = {Keywords: lock-free, multi-word compare-and-swap, persistent memory} }
Guy E. Blelloch and Yuanhao Wei. LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{blelloch_et_al:LIPIcs.DISC.2020.5, author = {Blelloch, Guy E. and Wei, Yuanhao}, title = {{LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {5:1--5:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.5}, URN = {urn:nbn:de:0030-drops-130831}, doi = {10.4230/LIPIcs.DISC.2020.5}, annote = {Keywords: LL/SC, Atomic Copy, CAS, Constant Time} }
Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, and Eric Severson. Message Complexity of Population Protocols. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 6:1-6:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{amir_et_al:LIPIcs.DISC.2020.6, author = {Amir, Talley and Aspnes, James and Doty, David and Eftekhari, Mahsa and Severson, Eric}, title = {{Message Complexity of Population Protocols}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {6:1--6:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.6}, URN = {urn:nbn:de:0030-drops-130848}, doi = {10.4230/LIPIcs.DISC.2020.6}, annote = {Keywords: population protocol, message complexity, space-optimal} }
Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, and Quentin Soubeyran. Distributed Computation with Continual Population Growth. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cho_et_al:LIPIcs.DISC.2020.7, author = {Cho, Da-Jung and F\"{u}gger, Matthias and Hopper, Corbin and Kushwaha, Manish and Nowak, Thomas and Soubeyran, Quentin}, title = {{Distributed Computation with Continual Population Growth}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.7}, URN = {urn:nbn:de:0030-drops-130856}, doi = {10.4230/LIPIcs.DISC.2020.7}, annote = {Keywords: microbiological circuits, majority consensus, birth-death processes} }
Aurélien Bellet, Rachid Guerraoui, and Hadrien Hendrikx. Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bellet_et_al:LIPIcs.DISC.2020.8, author = {Bellet, Aur\'{e}lien and Guerraoui, Rachid and Hendrikx, Hadrien}, title = {{Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.8}, URN = {urn:nbn:de:0030-drops-130868}, doi = {10.4230/LIPIcs.DISC.2020.8}, annote = {Keywords: Gossip Protocol, Rumor Spreading, Differential Privacy} }
George Giakkoupis, Hayk Saribekyan, and Thomas Sauerwald. Spread of Information and Diseases via Random Walks in Sparse Graphs. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 9:1-9:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{giakkoupis_et_al:LIPIcs.DISC.2020.9, author = {Giakkoupis, George and Saribekyan, Hayk and Sauerwald, Thomas}, title = {{Spread of Information and Diseases via Random Walks in Sparse Graphs}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {9:1--9:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.9}, URN = {urn:nbn:de:0030-drops-130873}, doi = {10.4230/LIPIcs.DISC.2020.9}, annote = {Keywords: parallel random walks, information dissemination, infectious diseases} }
Yael Hitron, Cameron Musco, and Merav Parter. Spiking Neural Networks Through the Lens of Streaming Algorithms. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hitron_et_al:LIPIcs.DISC.2020.10, author = {Hitron, Yael and Musco, Cameron and Parter, Merav}, title = {{Spiking Neural Networks Through the Lens of Streaming Algorithms}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {10:1--10:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.10}, URN = {urn:nbn:de:0030-drops-130882}, doi = {10.4230/LIPIcs.DISC.2020.10}, annote = {Keywords: Biological distributed algorithms, Spiking neural networks, Streaming algorithms} }
Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, and Yasumasa Tamura. Communication Efficient Self-Stabilizing Leader Election. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{defago_et_al:LIPIcs.DISC.2020.11, author = {D\'{e}fago, Xavier and Emek, Yuval and Kutten, Shay and Masuzawa, Toshimitsu and Tamura, Yasumasa}, title = {{Communication Efficient Self-Stabilizing Leader Election}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {11:1--11:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.11}, URN = {urn:nbn:de:0030-drops-130892}, doi = {10.4230/LIPIcs.DISC.2020.11}, annote = {Keywords: self-stabilization, leader election, communication overhead} }
Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta, and Yukiko Yamauchi. Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{diluna_et_al:LIPIcs.DISC.2020.12, author = {Di Luna, Giuseppe A. and Uehara, Ryuhei and Viglietta, Giovanni and Yamauchi, Yukiko}, title = {{Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.12}, URN = {urn:nbn:de:0030-drops-130907}, doi = {10.4230/LIPIcs.DISC.2020.12}, annote = {Keywords: Mobile robots, Gathering, limited visibility, circle} }
Sebastian Brandt, Julian Portmann, and Jara Uitto. Tight Bounds for Deterministic High-Dimensional Grid Exploration. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{brandt_et_al:LIPIcs.DISC.2020.13, author = {Brandt, Sebastian and Portmann, Julian and Uitto, Jara}, title = {{Tight Bounds for Deterministic High-Dimensional Grid Exploration}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.13}, URN = {urn:nbn:de:0030-drops-130911}, doi = {10.4230/LIPIcs.DISC.2020.13}, annote = {Keywords: Mobile agents, finite automata, grid search} }
Guy Goren, Shay Vargaftik, and Yoram Moses. Distributed Dispatching in the Parallel Server Model. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{goren_et_al:LIPIcs.DISC.2020.14, author = {Goren, Guy and Vargaftik, Shay and Moses, Yoram}, title = {{Distributed Dispatching in the Parallel Server Model}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.14}, URN = {urn:nbn:de:0030-drops-130929}, doi = {10.4230/LIPIcs.DISC.2020.14}, annote = {Keywords: Distributed load balancing, Join the Shortest Queue, Tidal Water Filling, Parallel Server Model} }
Hsin-Hao Su and Hoa T. Vu. Distributed Dense Subgraph Detection and Low Outdegree Orientation. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 15:1-15:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{su_et_al:LIPIcs.DISC.2020.15, author = {Su, Hsin-Hao and Vu, Hoa T.}, title = {{Distributed Dense Subgraph Detection and Low Outdegree Orientation}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {15:1--15:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.15}, URN = {urn:nbn:de:0030-drops-130938}, doi = {10.4230/LIPIcs.DISC.2020.15}, annote = {Keywords: Distributed Algorithms, Network Algorithms} }
Yannic Maus and Tigran Tonoyan. Local Conflict Coloring Revisited: Linial for Lists. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{maus_et_al:LIPIcs.DISC.2020.16, author = {Maus, Yannic and Tonoyan, Tigran}, title = {{Local Conflict Coloring Revisited: Linial for Lists}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.16}, URN = {urn:nbn:de:0030-drops-130944}, doi = {10.4230/LIPIcs.DISC.2020.16}, annote = {Keywords: distributed graph coloring, list coloring, low intersecting set families} }
Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, and Jukka Suomela. Classification of Distributed Binary Labeling Problems. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 17:1-17:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{balliu_et_al:LIPIcs.DISC.2020.17, author = {Balliu, Alkida and Brandt, Sebastian and Efron, Yuval and Hirvonen, Juho and Maus, Yannic and Olivetti, Dennis and Suomela, Jukka}, title = {{Classification of Distributed Binary Labeling Problems}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {17:1--17:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.17}, URN = {urn:nbn:de:0030-drops-130957}, doi = {10.4230/LIPIcs.DISC.2020.17}, annote = {Keywords: LOCAL model, graph problems, locally checkable labeling problems, distributed computational complexity} }
Yi-Jun Chang. The Complexity Landscape of Distributed Locally Checkable Problems on Trees. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 18:1-18:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chang:LIPIcs.DISC.2020.18, author = {Chang, Yi-Jun}, title = {{The Complexity Landscape of Distributed Locally Checkable Problems on Trees}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.18}, URN = {urn:nbn:de:0030-drops-130964}, doi = {10.4230/LIPIcs.DISC.2020.18}, annote = {Keywords: Distributed algorithms, LOCAL model, locally checkable labeling} }
Ofer Grossman, Seri Khoury, and Ami Paz. Improved Hardness of Approximation of Diameter in the CONGEST Model. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 19:1-19:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{grossman_et_al:LIPIcs.DISC.2020.19, author = {Grossman, Ofer and Khoury, Seri and Paz, Ami}, title = {{Improved Hardness of Approximation of Diameter in the CONGEST Model}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {19:1--19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.19}, URN = {urn:nbn:de:0030-drops-130972}, doi = {10.4230/LIPIcs.DISC.2020.19}, annote = {Keywords: Distributed graph algorithms, Approximation algorithms, Lower bounds} }
Yuval Emek and Yuval Gil. Twenty-Two New Approximate Proof Labeling Schemes. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{emek_et_al:LIPIcs.DISC.2020.20, author = {Emek, Yuval and Gil, Yuval}, title = {{Twenty-Two New Approximate Proof Labeling Schemes}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.20}, URN = {urn:nbn:de:0030-drops-130983}, doi = {10.4230/LIPIcs.DISC.2020.20}, annote = {Keywords: proof labeling schemes, distributed graph problems, approximation algorithms} }
Merav Parter. Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 21:1-21:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{parter:LIPIcs.DISC.2020.21, author = {Parter, Merav}, title = {{Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {21:1--21:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.21}, URN = {urn:nbn:de:0030-drops-130992}, doi = {10.4230/LIPIcs.DISC.2020.21}, annote = {Keywords: Fault Tolerance, Distance Preservers, CONGEST} }
Shay Kutten, William K. Moses Jr., Gopal Pandurangan, and David Peleg. Singularly Optimal Randomized Leader Election. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 22:1-22:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kutten_et_al:LIPIcs.DISC.2020.22, author = {Kutten, Shay and Moses Jr., William K. and Pandurangan, Gopal and Peleg, David}, title = {{Singularly Optimal Randomized Leader Election}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {22:1--22:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.22}, URN = {urn:nbn:de:0030-drops-131002}, doi = {10.4230/LIPIcs.DISC.2020.22}, annote = {Keywords: Leader election, Asynchronous systems, Randomized algorithms, Singularly optimal, Complete networks} }
Manuel Bravo, Gregory Chockler, and Alexey Gotsman. Making Byzantine Consensus Live. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 23:1-23:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bravo_et_al:LIPIcs.DISC.2020.23, author = {Bravo, Manuel and Chockler, Gregory and Gotsman, Alexey}, title = {{Making Byzantine Consensus Live}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {23:1--23:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.23}, URN = {urn:nbn:de:0030-drops-131013}, doi = {10.4230/LIPIcs.DISC.2020.23}, annote = {Keywords: Byzantine consensus, blockchain, partial synchrony, liveness} }
Tuanir França Rezende and Pierre Sutra. Leaderless State-Machine Replication: Specification, Properties, Limits. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 24:1-24:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{francarezende_et_al:LIPIcs.DISC.2020.24, author = {Fran\c{c}a Rezende, Tuanir and Sutra, Pierre}, title = {{Leaderless State-Machine Replication: Specification, Properties, Limits}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {24:1--24:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.24}, URN = {urn:nbn:de:0030-drops-131024}, doi = {10.4230/LIPIcs.DISC.2020.24}, annote = {Keywords: Fault Tolerance, State Machine Replication, Consensus} }
Shir Cohen, Idit Keidar, and Alexander Spiegelman. Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cohen_et_al:LIPIcs.DISC.2020.25, author = {Cohen, Shir and Keidar, Idit and Spiegelman, Alexander}, title = {{Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.25}, URN = {urn:nbn:de:0030-drops-131034}, doi = {10.4230/LIPIcs.DISC.2020.25}, annote = {Keywords: shared coin, Byzantine Agreement, VRF, sub-quadratic consensus protocol} }
Oded Naor and Idit Keidar. Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 26:1-26:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{naor_et_al:LIPIcs.DISC.2020.26, author = {Naor, Oded and Keidar, Idit}, title = {{Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {26:1--26:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.26}, URN = {urn:nbn:de:0030-drops-131046}, doi = {10.4230/LIPIcs.DISC.2020.26}, annote = {Keywords: Distributed Systems, State Machine Replication} }
Petr Kuznetsov and Andrei Tonkikh. Asynchronous Reconfiguration with Byzantine Failures. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 27:1-27:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kuznetsov_et_al:LIPIcs.DISC.2020.27, author = {Kuznetsov, Petr and Tonkikh, Andrei}, title = {{Asynchronous Reconfiguration with Byzantine Failures}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {27:1--27:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.27}, URN = {urn:nbn:de:0030-drops-131054}, doi = {10.4230/LIPIcs.DISC.2020.27}, annote = {Keywords: Reconfiguration, Asynchronous Models, Byzantine Faults} }
Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, and Zhuolun Xiang. Improved Extension Protocols for Byzantine Broadcast and Agreement. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{nayak_et_al:LIPIcs.DISC.2020.28, author = {Nayak, Kartik and Ren, Ling and Shi, Elaine and Vaidya, Nitin H. and Xiang, Zhuolun}, title = {{Improved Extension Protocols for Byzantine Broadcast and Agreement}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.28}, URN = {urn:nbn:de:0030-drops-131064}, doi = {10.4230/LIPIcs.DISC.2020.28}, annote = {Keywords: Byzantine agreement, Byzantine broadcast, extension protocol, communication complexity} }
Diana Ghinea, Martin Hirt, and Chen-Da Liu-Zhang. From Partial to Global Asynchronous Reliable Broadcast. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ghinea_et_al:LIPIcs.DISC.2020.29, author = {Ghinea, Diana and Hirt, Martin and Liu-Zhang, Chen-Da}, title = {{From Partial to Global Asynchronous Reliable Broadcast}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.29}, URN = {urn:nbn:de:0030-drops-131074}, doi = {10.4230/LIPIcs.DISC.2020.29}, annote = {Keywords: asynchronous broadcast, partial broadcast} }
Bogdan S. Chlebus, Dariusz R. Kowalski, and Jan Olkowski. Fast Agreement in Networks with Byzantine Nodes. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 30:1-30:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chlebus_et_al:LIPIcs.DISC.2020.30, author = {Chlebus, Bogdan S. and Kowalski, Dariusz R. and Olkowski, Jan}, title = {{Fast Agreement in Networks with Byzantine Nodes}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {30:1--30:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.30}, URN = {urn:nbn:de:0030-drops-131088}, doi = {10.4230/LIPIcs.DISC.2020.30}, annote = {Keywords: distributed algorithm, network, Consensus, Byzantine fault, message authentication, node crash, lower bound} }
John Augustine, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, and Jared Saia. Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 31:1-31:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{augustine_et_al:LIPIcs.DISC.2020.31, author = {Augustine, John and King, Valerie and Molla, Anisur Rahaman and Pandurangan, Gopal and Saia, Jared}, title = {{Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {31:1--31:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.31}, URN = {urn:nbn:de:0030-drops-131093}, doi = {10.4230/LIPIcs.DISC.2020.31}, annote = {Keywords: Byzantine protocols, Byzantine agreement, Leader election, Committee election, Message-competitive protocol, Randomized protocol} }
Xiong Zheng and Vijay Garg. Byzantine Lattice Agreement in Synchronous Message Passing Systems. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 32:1-32:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{zheng_et_al:LIPIcs.DISC.2020.32, author = {Zheng, Xiong and Garg, Vijay}, title = {{Byzantine Lattice Agreement in Synchronous Message Passing Systems}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {32:1--32:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.32}, URN = {urn:nbn:de:0030-drops-131106}, doi = {10.4230/LIPIcs.DISC.2020.32}, annote = {Keywords: Lattice agreement, Byzantine Failure, Gradecast} }
Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, and Rotem Oshman. Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 33:1-33:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{censorhillel_et_al:LIPIcs.DISC.2020.33, author = {Censor-Hillel, Keren and Fischer, Orr and Gonen, Tzlil and Le Gall, Fran\c{c}ois and Leitersdorf, Dean and Oshman, Rotem}, title = {{Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {33:1--33:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.33}, URN = {urn:nbn:de:0030-drops-131115}, doi = {10.4230/LIPIcs.DISC.2020.33}, annote = {Keywords: distributed graph algorithms, cycles, girth, Congested Clique, CONGEST} }
Mohsen Ghaffari, Christoph Grunau, and Ce Jin. Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 34:1-34:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ghaffari_et_al:LIPIcs.DISC.2020.34, author = {Ghaffari, Mohsen and Grunau, Christoph and Jin, Ce}, title = {{Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {34:1--34:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.34}, URN = {urn:nbn:de:0030-drops-131128}, doi = {10.4230/LIPIcs.DISC.2020.34}, annote = {Keywords: Massively Parallel Computation, MIS, Matching, Coloring} }
Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, and Gregory Schwartzman. Improved Distributed Approximations for Maximum Independent Set. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 35:1-35:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kawarabayashi_et_al:LIPIcs.DISC.2020.35, author = {Kawarabayashi, Ken-ichi and Khoury, Seri and Schild, Aaron and Schwartzman, Gregory}, title = {{Improved Distributed Approximations for Maximum Independent Set}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {35:1--35:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.35}, URN = {urn:nbn:de:0030-drops-131135}, doi = {10.4230/LIPIcs.DISC.2020.35}, annote = {Keywords: Distributed graph algorithms, Approximation algorithms, Lower bounds} }
Uri Meir, Ami Paz, and Gregory Schwartzman. Models of Smoothing in Dynamic Networks. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{meir_et_al:LIPIcs.DISC.2020.36, author = {Meir, Uri and Paz, Ami and Schwartzman, Gregory}, title = {{Models of Smoothing in Dynamic Networks}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {36:1--36:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.36}, URN = {urn:nbn:de:0030-drops-131145}, doi = {10.4230/LIPIcs.DISC.2020.36}, annote = {Keywords: Distributed dynamic graph algorithms, Smoothed analysis, Flooding} }
Mohamad Ahmadi and Fabian Kuhn. Distributed Maximum Matching Verification in CONGEST. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 37:1-37:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ahmadi_et_al:LIPIcs.DISC.2020.37, author = {Ahmadi, Mohamad and Kuhn, Fabian}, title = {{Distributed Maximum Matching Verification in CONGEST}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {37:1--37:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.37}, URN = {urn:nbn:de:0030-drops-131151}, doi = {10.4230/LIPIcs.DISC.2020.37}, annote = {Keywords: distributed matching, distributed graph algorithms, augmenting paths} }
Merav Parter. Distributed Planar Reachability in Nearly Optimal Time. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 38:1-38:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{parter:LIPIcs.DISC.2020.38, author = {Parter, Merav}, title = {{Distributed Planar Reachability in Nearly Optimal Time}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {38:1--38:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.38}, URN = {urn:nbn:de:0030-drops-131160}, doi = {10.4230/LIPIcs.DISC.2020.38}, annote = {Keywords: Distributed Graph Algorithms, Planar Graphs, Reachability} }
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Alexandre Nolin. Coloring Fast Without Learning Your Neighbors' Colors. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 39:1-39:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{halldorsson_et_al:LIPIcs.DISC.2020.39, author = {Halld\'{o}rsson, Magn\'{u}s M. and Kuhn, Fabian and Maus, Yannic and Nolin, Alexandre}, title = {{Coloring Fast Without Learning Your Neighbors' Colors}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {39:1--39:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.39}, URN = {urn:nbn:de:0030-drops-131170}, doi = {10.4230/LIPIcs.DISC.2020.39}, annote = {Keywords: distributed graph coloring, distance 2 coloring, congestion} }
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 40:1-40:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{brandt_et_al:LIPIcs.DISC.2020.40, author = {Brandt, Sebastian and Keller, Barbara and Rybicki, Joel and Suomela, Jukka and Uitto, Jara}, title = {{Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {40:1--40:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.40}, URN = {urn:nbn:de:0030-drops-131182}, doi = {10.4230/LIPIcs.DISC.2020.40}, annote = {Keywords: distributed algorithms, graph problems, semi-matching} }
Yi-Jun Chang, Jan Studený, and Jukka Suomela. Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 41:1-41:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{chang_et_al:LIPIcs.DISC.2020.41, author = {Chang, Yi-Jun and Studen\'{y}, Jan and Suomela, Jukka}, title = {{Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {41:1--41:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.41}, URN = {urn:nbn:de:0030-drops-131197}, doi = {10.4230/LIPIcs.DISC.2020.41}, annote = {Keywords: Algorithm synthesis, locally checkable labeling problems, LOCAL model, locality, distributed computational complexity, nondeterministic finite automata} }
Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, and Sara Rizzo. Brief Announcement: Phase Transitions of the k-Majority Dynamics in a Biased Communication Model. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 42:1-42:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{cruciani_et_al:LIPIcs.DISC.2020.42, author = {Cruciani, Emilio and Mimun, Hlafo Alfie and Quattropani, Matteo and Rizzo, Sara}, title = {{Brief Announcement: Phase Transitions of the k-Majority Dynamics in a Biased Communication Model}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {42:1--42:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.42}, URN = {urn:nbn:de:0030-drops-131200}, doi = {10.4230/LIPIcs.DISC.2020.42}, annote = {Keywords: Biased Communication, Consensus, Majority Dynamics, Markov Chains, Metastability} }
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, and Ami Paz. Brief Announcement: Distributed Quantum Proofs for Replicated Data. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 43:1-43:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{fraigniaud_et_al:LIPIcs.DISC.2020.43, author = {Fraigniaud, Pierre and Le Gall, Fran\c{c}ois and Nishimura, Harumichi and Paz, Ami}, title = {{Brief Announcement: Distributed Quantum Proofs for Replicated Data}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {43:1--43:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.43}, URN = {urn:nbn:de:0030-drops-131217}, doi = {10.4230/LIPIcs.DISC.2020.43}, annote = {Keywords: Quantum Computing, Distributed Network Computing, Algorithmic Aspects of Networks} }
Ashish Choudhury. Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 44:1-44:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{choudhury:LIPIcs.DISC.2020.44, author = {Choudhury, Ashish}, title = {{Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {44:1--44:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.44}, URN = {urn:nbn:de:0030-drops-131223}, doi = {10.4230/LIPIcs.DISC.2020.44}, annote = {Keywords: Verifiable Secret-sharing, Secure MPC, Fault-tolerance, Byzantine faults, secret-sharing, unconditional-security, privacy} }
Pierre Civit, Seth Gilbert, and Vincent Gramoli. Brief Announcement: Polygraph: Accountable Byzantine Agreement. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 45:1-45:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{civit_et_al:LIPIcs.DISC.2020.45, author = {Civit, Pierre and Gilbert, Seth and Gramoli, Vincent}, title = {{Brief Announcement: Polygraph: Accountable Byzantine Agreement}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {45:1--45:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.45}, URN = {urn:nbn:de:0030-drops-131236}, doi = {10.4230/LIPIcs.DISC.2020.45}, annote = {Keywords: Fault detection, cryptography, equivocation, consensus} }
Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tredan. Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 46:1-46:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{foerster_et_al:LIPIcs.DISC.2020.46, author = {Foerster, Klaus-Tycho and Hirvonen, Juho and Pignolet, Yvonne-Anne and Schmid, Stefan and Tredan, Gilles}, title = {{Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {46:1--46:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.46}, URN = {urn:nbn:de:0030-drops-131244}, doi = {10.4230/LIPIcs.DISC.2020.46}, annote = {Keywords: Resilience, Local Failover} }
Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang. Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 47:1-47:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{abraham_et_al:LIPIcs.DISC.2020.47, author = {Abraham, Ittai and Nayak, Kartik and Ren, Ling and Xiang, Zhuolun}, title = {{Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {47:1--47:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.47}, URN = {urn:nbn:de:0030-drops-131259}, doi = {10.4230/LIPIcs.DISC.2020.47}, annote = {Keywords: Byzantine broadcast, synchrony, latency, state machine replication} }
Martin Hirt, Ard Kastrati, and Chen-Da Liu-Zhang. Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 48:1-48:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{hirt_et_al:LIPIcs.DISC.2020.48, author = {Hirt, Martin and Kastrati, Ard and Liu-Zhang, Chen-Da}, title = {{Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {48:1--48:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.48}, URN = {urn:nbn:de:0030-drops-131267}, doi = {10.4230/LIPIcs.DISC.2020.48}, annote = {Keywords: broadcast, byzantine agreement, multi-threshold} }
Paolo Zappalà, Marianna Belotti, Maria Potop-Butucaru, and Stefano Secci. Brief Announcement: Game Theoretical Framework for Analyzing Blockchains Robustness. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 49:1-49:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{zappala_et_al:LIPIcs.DISC.2020.49, author = {Zappal\`{a}, Paolo and Belotti, Marianna and Potop-Butucaru, Maria and Secci, Stefano}, title = {{Brief Announcement: Game Theoretical Framework for Analyzing Blockchains Robustness}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {49:1--49:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.49}, URN = {urn:nbn:de:0030-drops-131275}, doi = {10.4230/LIPIcs.DISC.2020.49}, annote = {Keywords: Blockchains, Game Theory, Byzantine-Altruistic-Rational behaviours} }
Dolev Adas and Roy Friedman. Brief Announcement: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 50:1-50:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{adas_et_al:LIPIcs.DISC.2020.50, author = {Adas, Dolev and Friedman, Roy}, title = {{Brief Announcement: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {50:1--50:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.50}, URN = {urn:nbn:de:0030-drops-131287}, doi = {10.4230/LIPIcs.DISC.2020.50}, annote = {Keywords: Wait-freedom, MPSC Queues, Concurrent data-structures} }
Guy E. Blelloch and Yuanhao Wei. Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 51:1-51:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{blelloch_et_al:LIPIcs.DISC.2020.51, author = {Blelloch, Guy E. and Wei, Yuanhao}, title = {{Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {51:1--51:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.51}, URN = {urn:nbn:de:0030-drops-131291}, doi = {10.4230/LIPIcs.DISC.2020.51}, annote = {Keywords: malloc, free, fixed-size, concurrent, constant time} }
Haosen Wen, Wentao Cai, Mingzhe Du, Benjamin Valpey, and Michael L. Scott. Brief Announcement: Building Fast Recoverable Persistent Data Structures with Montage. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 52:1-52:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{wen_et_al:LIPIcs.DISC.2020.52, author = {Wen, Haosen and Cai, Wentao and Du, Mingzhe and Valpey, Benjamin and Scott, Michael L.}, title = {{Brief Announcement: Building Fast Recoverable Persistent Data Structures with Montage}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {52:1--52:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.52}, URN = {urn:nbn:de:0030-drops-131304}, doi = {10.4230/LIPIcs.DISC.2020.52}, annote = {Keywords: Durable linearizability, consistency, persistence, fault tolerance} }
Lewis Tseng, Qinzi Zhang, and Yifan Zhang. Brief Announcement: Reaching Approximate Consensus When Everyone May Crash. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 53:1-53:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{tseng_et_al:LIPIcs.DISC.2020.53, author = {Tseng, Lewis and Zhang, Qinzi and Zhang, Yifan}, title = {{Brief Announcement: Reaching Approximate Consensus When Everyone May Crash}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {53:1--53:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.53}, URN = {urn:nbn:de:0030-drops-131319}, doi = {10.4230/LIPIcs.DISC.2020.53}, annote = {Keywords: Approximate Consensus, Fair-loss Channel, Crash-recovery} }
Petr Kuznetsov and Thibault Rieutord. Brief Announcement: On Decidability of 2-Process Affine Models. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 54:1-54:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kuznetsov_et_al:LIPIcs.DISC.2020.54, author = {Kuznetsov, Petr and Rieutord, Thibault}, title = {{Brief Announcement: On Decidability of 2-Process Affine Models}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {54:1--54:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.54}, URN = {urn:nbn:de:0030-drops-131328}, doi = {10.4230/LIPIcs.DISC.2020.54}, annote = {Keywords: Affine tasks, Decidability} }