33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Proceedings{suomela:LIPIcs.DISC.2019, title = {{LIPIcs, Volume 146, DISC'19, Complete Volume}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019}, URN = {urn:nbn:de:0030-drops-113878}, doi = {10.4230/LIPIcs.DISC.2019}, annote = {Keywords: Software and its engineering, Distributed systems organizing principles; Computing methodologies, Distributed computing methodologies} }
33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{suomela:LIPIcs.DISC.2019.0, author = {Suomela, Jukka}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.0}, URN = {urn:nbn:de:0030-drops-113074}, doi = {10.4230/LIPIcs.DISC.2019.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
James Aspnes and He Yang Er. Consensus with Max Registers. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 1:1-1:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{aspnes_et_al:LIPIcs.DISC.2019.1, author = {Aspnes, James and Er, He Yang}, title = {{Consensus with Max Registers}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {1:1--1:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.1}, URN = {urn:nbn:de:0030-drops-113088}, doi = {10.4230/LIPIcs.DISC.2019.1}, annote = {Keywords: consensus, max register, single-writer register, oblivious adversary, shared memory} }
Hagit Attiya and Constantin Enea. Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs That Use Concurrent Objects. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{attiya_et_al:LIPIcs.DISC.2019.2, author = {Attiya, Hagit and Enea, Constantin}, title = {{Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs That Use Concurrent Objects}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {2:1--2:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.2}, URN = {urn:nbn:de:0030-drops-113095}, doi = {10.4230/LIPIcs.DISC.2019.2}, annote = {Keywords: Concurrent Objects, Linearizability, Hyperproperties, Forward Simulations} }
Mirza Ahad Baig, Danny Hendler, Alessia Milani, and Corentin Travers. Long-Lived Counters with Polylogarithmic Amortized Step Complexity. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 3:1-3:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{baig_et_al:LIPIcs.DISC.2019.3, author = {Baig, Mirza Ahad and Hendler, Danny and Milani, Alessia and Travers, Corentin}, title = {{Long-Lived Counters with Polylogarithmic Amortized Step Complexity}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {3:1--3:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.3}, URN = {urn:nbn:de:0030-drops-113108}, doi = {10.4230/LIPIcs.DISC.2019.3}, annote = {Keywords: Shared Memory, Wait-freedom, Counter, Amortized Complexity, Concurrent Objects} }
Ruben Becker, Yuval Emek, Mohsen Ghaffari, and Christoph Lenzen. Distributed Algorithms for Low Stretch Spanning Trees. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{becker_et_al:LIPIcs.DISC.2019.4, author = {Becker, Ruben and Emek, Yuval and Ghaffari, Mohsen and Lenzen, Christoph}, title = {{Distributed Algorithms for Low Stretch Spanning Trees}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {4:1--4:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.4}, URN = {urn:nbn:de:0030-drops-113116}, doi = {10.4230/LIPIcs.DISC.2019.4}, annote = {Keywords: distributed graph algorithms, low-stretch spanning trees, CONGEST model, ball decomposition, star decomposition} }
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, and Gregory Schwartzman. Optimal Distributed Covering Algorithms. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 5:1-5:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{benbasat_et_al:LIPIcs.DISC.2019.5, author = {Ben-Basat, Ran and Even, Guy and Kawarabayashi, Ken-ichi and Schwartzman, Gregory}, title = {{Optimal Distributed Covering Algorithms}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {5:1--5:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.5}, URN = {urn:nbn:de:0030-drops-113129}, doi = {10.4230/LIPIcs.DISC.2019.5}, annote = {Keywords: Distributed Algorithms, Approximation Algorithms, Vertex Cover, Set Cover} }
Ran Ben-Basat, Ken-ichi Kawarabayashi, and Gregory Schwartzman. Parameterized Distributed Algorithms. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{benbasat_et_al:LIPIcs.DISC.2019.6, author = {Ben-Basat, Ran and Kawarabayashi, Ken-ichi and Schwartzman, Gregory}, title = {{Parameterized Distributed Algorithms}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {6:1--6:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.6}, URN = {urn:nbn:de:0030-drops-113135}, doi = {10.4230/LIPIcs.DISC.2019.6}, annote = {Keywords: Distributed Algorithms, Approximation Algorithms, Parameterized Algorithms} }
Shimon Bitton, Yuval Emek, Taisuke Izumi, and Shay Kutten. Message Reduction in the LOCAL Model Is a Free Lunch. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bitton_et_al:LIPIcs.DISC.2019.7, author = {Bitton, Shimon and Emek, Yuval and Izumi, Taisuke and Kutten, Shay}, title = {{Message Reduction in the LOCAL Model Is a Free Lunch}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.7}, URN = {urn:nbn:de:0030-drops-113145}, doi = {10.4230/LIPIcs.DISC.2019.7}, annote = {Keywords: distributed graph algorithms, spanner, LOCAL model, message complexity} }
Mark Braverman, Gillat Kol, Rotem Oshman, and Avishay Tal. On the Computational Power of Radio Channels. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{braverman_et_al:LIPIcs.DISC.2019.8, author = {Braverman, Mark and Kol, Gillat and Oshman, Rotem and Tal, Avishay}, title = {{On the Computational Power of Radio Channels}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {8:1--8:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.8}, URN = {urn:nbn:de:0030-drops-113152}, doi = {10.4230/LIPIcs.DISC.2019.8}, annote = {Keywords: radio channel, lower bounds, approximate majority} }
Janna Burman, Joffroy Beauquier, and Devan Sohier. Space-Optimal Naming in Population Protocols. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{burman_et_al:LIPIcs.DISC.2019.9, author = {Burman, Janna and Beauquier, Joffroy and Sohier, Devan}, title = {{Space-Optimal Naming in Population Protocols}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.9}, URN = {urn:nbn:de:0030-drops-113161}, doi = {10.4230/LIPIcs.DISC.2019.9}, annote = {Keywords: networks of passively mobile agents, population protocols, deterministic naming, self-stabilization, exact space complexity, tight lower bounds, global and weak fairness} }
Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, and Goran Zuzic. Erasure Correction for Noisy Radio Networks. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 10:1-10:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{censorhillel_et_al:LIPIcs.DISC.2019.10, author = {Censor-Hillel, Keren and Haeupler, Bernhard and Hershkowitz, D. Ellis and Zuzic, Goran}, title = {{Erasure Correction for Noisy Radio Networks}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {10:1--10:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.10}, URN = {urn:nbn:de:0030-drops-113170}, doi = {10.4230/LIPIcs.DISC.2019.10}, annote = {Keywords: radio networks, erasure correction, noisy radio networks, protocol simulation, distributed computing models} }
Shiri Chechik and Doron Mukhtar. Reachability and Shortest Paths in the Broadcast CONGEST Model. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chechik_et_al:LIPIcs.DISC.2019.11, author = {Chechik, Shiri and Mukhtar, Doron}, title = {{Reachability and Shortest Paths in the Broadcast CONGEST Model}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {11:1--11:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.11}, URN = {urn:nbn:de:0030-drops-113183}, doi = {10.4230/LIPIcs.DISC.2019.11}, annote = {Keywords: Distributed algorithms, Broadcast CONGEST, distance estimation, small diameter} }
Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, and Alex Samorodnitsky. On the Round Complexity of Randomized Byzantine Agreement. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{cohen_et_al:LIPIcs.DISC.2019.12, author = {Cohen, Ran and Haitner, Iftach and Makriyannis, Nikolaos and Orland, Matan and Samorodnitsky, Alex}, title = {{On the Round Complexity of Randomized Byzantine Agreement}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.12}, URN = {urn:nbn:de:0030-drops-113199}, doi = {10.4230/LIPIcs.DISC.2019.12}, annote = {Keywords: Byzantine agreement, lower bound, round complexity} }
Pierluigi Crescenzi, Pierre Fraigniaud, and Ami Paz. Trade-Offs in Distributed Interactive Proofs. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 13:1-13:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{crescenzi_et_al:LIPIcs.DISC.2019.13, author = {Crescenzi, Pierluigi and Fraigniaud, Pierre and Paz, Ami}, title = {{Trade-Offs in Distributed Interactive Proofs}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {13:1--13:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.13}, URN = {urn:nbn:de:0030-drops-113202}, doi = {10.4230/LIPIcs.DISC.2019.13}, annote = {Keywords: Distributed interactive proofs, Distributed verification} }
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, and Alex Weaver. The Capacity of Smartphone Peer-To-Peer Networks. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 14:1-14:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dinitz_et_al:LIPIcs.DISC.2019.14, author = {Dinitz, Michael and Halld\'{o}rsson, Magn\'{u}s M. and Newport, Calvin and Weaver, Alex}, title = {{The Capacity of Smartphone Peer-To-Peer Networks}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {14:1--14:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.14}, URN = {urn:nbn:de:0030-drops-113218}, doi = {10.4230/LIPIcs.DISC.2019.14}, annote = {Keywords: Capacity, Wireless, Mobile Telephone, Throughput} }
Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, and Rotem Oshman. Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{eden_et_al:LIPIcs.DISC.2019.15, author = {Eden, Talya and Fiat, Nimrod and Fischer, Orr and Kuhn, Fabian and Oshman, Rotem}, title = {{Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.15}, URN = {urn:nbn:de:0030-drops-113224}, doi = {10.4230/LIPIcs.DISC.2019.15}, annote = {Keywords: Distributed Computing, Subgraph Freeness, CONGEST} }
Orr Fischer and Rotem Oshman. A Distributed Algorithm for Directed Minimum-Weight Spanning Tree. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 16:1-16:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{fischer_et_al:LIPIcs.DISC.2019.16, author = {Fischer, Orr and Oshman, Rotem}, title = {{A Distributed Algorithm for Directed Minimum-Weight Spanning Tree}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {16:1--16:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.16}, URN = {urn:nbn:de:0030-drops-113236}, doi = {10.4230/LIPIcs.DISC.2019.16}, annote = {Keywords: Distributed Computing, Directed Minimum Spanning Tree, Minimum Arborescence, CONGEST} }
Paweł Garncarek, Tomasz Jurdziński, and Dariusz R. Kowalski. Stable Memoryless Queuing under Contention. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{garncarek_et_al:LIPIcs.DISC.2019.17, author = {Garncarek, Pawe{\l} and Jurdzi\'{n}ski, Tomasz and Kowalski, Dariusz R.}, title = {{Stable Memoryless Queuing under Contention}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.17}, URN = {urn:nbn:de:0030-drops-113244}, doi = {10.4230/LIPIcs.DISC.2019.17}, annote = {Keywords: packet scheduling, online algorithms, adversarial injections, stochastic injections, stability, memoryless algorithms} }
Mohsen Ghaffari and Julian Portmann. Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{ghaffari_et_al:LIPIcs.DISC.2019.18, author = {Ghaffari, Mohsen and Portmann, Julian}, title = {{Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.18}, URN = {urn:nbn:de:0030-drops-113259}, doi = {10.4230/LIPIcs.DISC.2019.18}, annote = {Keywords: Distributed Graph Algorithms, Network Decomposition, Maximal Independent Set, Neighborhood Cover} }
Seth Gilbert, James Maguire, and Calvin Newport. On Bioelectric Algorithms. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 19:1-19:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gilbert_et_al:LIPIcs.DISC.2019.19, author = {Gilbert, Seth and Maguire, James and Newport, Calvin}, title = {{On Bioelectric Algorithms}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {19:1--19:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.19}, URN = {urn:nbn:de:0030-drops-113267}, doi = {10.4230/LIPIcs.DISC.2019.19}, annote = {Keywords: biological distributed algorithms, bioelectric networks, natural algorithms} }
Seth Gilbert and Wei Quan Lim. Parallel Finger Search Structures. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gilbert_et_al:LIPIcs.DISC.2019.20, author = {Gilbert, Seth and Lim, Wei Quan}, title = {{Parallel Finger Search Structures}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {20:1--20:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.20}, URN = {urn:nbn:de:0030-drops-113275}, doi = {10.4230/LIPIcs.DISC.2019.20}, annote = {Keywords: Parallel data structures, Multithreading, Dictionaries, Comparison-based Search, Distribution-sensitive algorithms} }
Éric Goubault, Marijana Lazić, Jérémy Ledent, and Sergio Rajsbaum. Wait-Free Solvability of Equality Negation Tasks. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{goubault_et_al:LIPIcs.DISC.2019.21, author = {Goubault, \'{E}ric and Lazi\'{c}, Marijana and Ledent, J\'{e}r\'{e}my and Rajsbaum, Sergio}, title = {{Wait-Free Solvability of Equality Negation Tasks}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.21}, URN = {urn:nbn:de:0030-drops-113288}, doi = {10.4230/LIPIcs.DISC.2019.21}, annote = {Keywords: Equality negation, distributed computability, combinatorial topology} }
Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-Adrian Seredinschi. Scalable Byzantine Reliable Broadcast. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 22:1-22:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{guerraoui_et_al:LIPIcs.DISC.2019.22, author = {Guerraoui, Rachid and Kuznetsov, Petr and Monti, Matteo and Pavlovic, Matej and Seredinschi, Dragos-Adrian}, title = {{Scalable Byzantine Reliable Broadcast}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.22}, URN = {urn:nbn:de:0030-drops-113293}, doi = {10.4230/LIPIcs.DISC.2019.22}, annote = {Keywords: Byzantine reliable broadcast, probabilistic distributed algorithms, scalable distributed systems, stochastic processes} }
Kristian Hinnenthal, Christian Scheideler, and Martijn Struijs. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{hinnenthal_et_al:LIPIcs.DISC.2019.23, author = {Hinnenthal, Kristian and Scheideler, Christian and Struijs, Martijn}, title = {{Fast Distributed Algorithms for LP-Type Problems of Low Dimension}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {23:1--23:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.23}, URN = {urn:nbn:de:0030-drops-113306}, doi = {10.4230/LIPIcs.DISC.2019.23}, annote = {Keywords: LP-type problems, linear optimization, distributed algorithms, gossip algorithms} }
Artem Khyzha, Hagit Attiya, and Alexey Gotsman. Privatization-Safe Transactional Memories. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 24:1-24:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{khyzha_et_al:LIPIcs.DISC.2019.24, author = {Khyzha, Artem and Attiya, Hagit and Gotsman, Alexey}, title = {{Privatization-Safe Transactional Memories}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {24:1--24:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.24}, URN = {urn:nbn:de:0030-drops-113310}, doi = {10.4230/LIPIcs.DISC.2019.24}, annote = {Keywords: Transactional memory, privatization, observational refinement} }
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, and Taisuke Izumi. Low-Congestion Shortcut and Graph Parameters. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kitamura_et_al:LIPIcs.DISC.2019.25, author = {Kitamura, Naoki and Kitagawa, Hirotaka and Otachi, Yota and Izumi, Taisuke}, title = {{Low-Congestion Shortcut and Graph Parameters}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.25}, URN = {urn:nbn:de:0030-drops-113328}, doi = {10.4230/LIPIcs.DISC.2019.25}, annote = {Keywords: distributed graph algorithms, low-congestion shortcut, k-chordal graph, clique width, minimum spanning tree} }
Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, and Peter Robinson. The Complexity of Symmetry Breaking in Massive Graphs. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 26:1-26:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{konrad_et_al:LIPIcs.DISC.2019.26, author = {Konrad, Christian and Pemmaraju, Sriram V. and Riaz, Talal and Robinson, Peter}, title = {{The Complexity of Symmetry Breaking in Massive Graphs}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {26:1--26:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.26}, URN = {urn:nbn:de:0030-drops-113337}, doi = {10.4230/LIPIcs.DISC.2019.26}, annote = {Keywords: communication complexity, information theory, k-machine model, maximal independent set, ruling set, streaming algorithms} }
Giuliano Losa, Eli Gafni, and David Mazières. Stellar Consensus by Instantiation. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 27:1-27:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{losa_et_al:LIPIcs.DISC.2019.27, author = {Losa, Giuliano and Gafni, Eli and Mazi\`{e}res, David}, title = {{Stellar Consensus by Instantiation}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {27:1--27:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.27}, URN = {urn:nbn:de:0030-drops-113343}, doi = {10.4230/LIPIcs.DISC.2019.27}, annote = {Keywords: Consensus, Stellar, Partial Synchrony, Byzantine Fault Tolerance} }
Ruslan Nikolaev. A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{nikolaev:LIPIcs.DISC.2019.28, author = {Nikolaev, Ruslan}, title = {{A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.28}, URN = {urn:nbn:de:0030-drops-113356}, doi = {10.4230/LIPIcs.DISC.2019.28}, annote = {Keywords: FIFO, queue, ring buffer, lock-free, non-blocking} }
Thomas Nowak and Joel Rybicki. Byzantine Approximate Agreement on Graphs. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 29:1-29:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{nowak_et_al:LIPIcs.DISC.2019.29, author = {Nowak, Thomas and Rybicki, Joel}, title = {{Byzantine Approximate Agreement on Graphs}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {29:1--29:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.29}, URN = {urn:nbn:de:0030-drops-113363}, doi = {10.4230/LIPIcs.DISC.2019.29}, annote = {Keywords: consensus, approximate agreement, Byzantine faults, chordal graphs, lattice agreement} }
Merav Parter. Small Cuts and Connectivity Certificates: A Fault Tolerant Approach. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{parter:LIPIcs.DISC.2019.30, author = {Parter, Merav}, title = {{Small Cuts and Connectivity Certificates: A Fault Tolerant Approach}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {30:1--30:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.30}, URN = {urn:nbn:de:0030-drops-113371}, doi = {10.4230/LIPIcs.DISC.2019.30}, annote = {Keywords: Connectivity, Minimum Cut, Spanners} }
Adones Rukundo, Aras Atalar, and Philippas Tsigas. Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design Framework. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 31:1-31:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{rukundo_et_al:LIPIcs.DISC.2019.31, author = {Rukundo, Adones and Atalar, Aras and Tsigas, Philippas}, title = {{Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design Framework}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {31:1--31:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.31}, URN = {urn:nbn:de:0030-drops-113382}, doi = {10.4230/LIPIcs.DISC.2019.31}, annote = {Keywords: Lock Free, Concurrency, Semantics Relaxation, Data Structures} }
Nobutaka Shimizu and Takeharu Shiraga. Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{shimizu_et_al:LIPIcs.DISC.2019.32, author = {Shimizu, Nobutaka and Shiraga, Takeharu}, title = {{Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {32:1--32:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.32}, URN = {urn:nbn:de:0030-drops-113397}, doi = {10.4230/LIPIcs.DISC.2019.32}, annote = {Keywords: Distributed Voting, Consensus Problem, Random Graph} }
Hsin-Hao Su and Hoa T. Vu. Distributed Data Summarization in Well-Connected Networks. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 33:1-33:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{su_et_al:LIPIcs.DISC.2019.33, author = {Su, Hsin-Hao and Vu, Hoa T.}, title = {{Distributed Data Summarization in Well-Connected Networks}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {33:1--33:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.33}, URN = {urn:nbn:de:0030-drops-113400}, doi = {10.4230/LIPIcs.DISC.2019.33}, annote = {Keywords: Distributed Algorithms, Network Algorithms, Data Summarization} }
Mohammad Taheri, Arash Pourdamghani, and Mohsen Lesani. Polynomial-Time Fence Insertion for Structured Programs. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 34:1-34:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{taheri_et_al:LIPIcs.DISC.2019.34, author = {Taheri, Mohammad and Pourdamghani, Arash and Lesani, Mohsen}, title = {{Polynomial-Time Fence Insertion for Structured Programs}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {34:1--34:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.34}, URN = {urn:nbn:de:0030-drops-113412}, doi = {10.4230/LIPIcs.DISC.2019.34}, annote = {Keywords: Fence Insertion, Synchronization, Concurrent Programming} }
Chen Avin, Iosif Salem, and Stefan Schmid. Brief Announcement: On Self-Adjusting Skip List Networks. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 35:1-35:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{avin_et_al:LIPIcs.DISC.2019.35, author = {Avin, Chen and Salem, Iosif and Schmid, Stefan}, title = {{Brief Announcement: On Self-Adjusting Skip List Networks}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {35:1--35:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.35}, URN = {urn:nbn:de:0030-drops-113423}, doi = {10.4230/LIPIcs.DISC.2019.35}, annote = {Keywords: self-adjusting networks, skip lists, working set, online algorithms} }
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, and Hamed Saleh. Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 36:1-36:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{behnezhad_et_al:LIPIcs.DISC.2019.36, author = {Behnezhad, Soheil and Derakhshan, Mahsa and Hajiaghayi, MohammadTaghi and Knittel, Marina and Saleh, Hamed}, title = {{Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {36:1--36:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.36}, URN = {urn:nbn:de:0030-drops-113438}, doi = {10.4230/LIPIcs.DISC.2019.36}, annote = {Keywords: Massively Parallel Computation, Streaming, Edge Coloring} }
Lélia Blin, Laurent Feuilloley, and Gabriel Le Bouder. Brief Announcement: Memory Lower Bounds for Self-Stabilization. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 37:1-37:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{blin_et_al:LIPIcs.DISC.2019.37, author = {Blin, L\'{e}lia and Feuilloley, Laurent and Le Bouder, Gabriel}, title = {{Brief Announcement: Memory Lower Bounds for Self-Stabilization}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {37:1--37:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.37}, URN = {urn:nbn:de:0030-drops-113442}, doi = {10.4230/LIPIcs.DISC.2019.37}, annote = {Keywords: Space lower bound, memory tight bound, deterministic self-stabilization, leader election, anonymous, identifiers, state model, ring} }
Grégoire Bonin, Achour Mostéfaoui, and Matthieu Perrin. Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 38:1-38:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bonin_et_al:LIPIcs.DISC.2019.38, author = {Bonin, Gr\'{e}goire and Most\'{e}faoui, Achour and Perrin, Matthieu}, title = {{Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {38:1--38:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.38}, URN = {urn:nbn:de:0030-drops-113454}, doi = {10.4230/LIPIcs.DISC.2019.38}, annote = {Keywords: Concurrent object, Consensus, Infinite arrival model, Linearizability, Universal construction, Wait-freedom} }
Christian Cachin and Björn Tackmann. Brief Announcement: Asymmetric Distributed Trust. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 39:1-39:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{cachin_et_al:LIPIcs.DISC.2019.39, author = {Cachin, Christian and Tackmann, Bj\"{o}rn}, title = {{Brief Announcement: Asymmetric Distributed Trust}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {39:1--39:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.39}, URN = {urn:nbn:de:0030-drops-113460}, doi = {10.4230/LIPIcs.DISC.2019.39}, annote = {Keywords: Quorums, consensus, distributed trust, blockchains, cryptocurrencies} }
Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, and Nicolas Nicolaou. Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 40:1-40:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{cholvi_et_al:LIPIcs.DISC.2019.40, author = {Cholvi, Vicent and Anta, Antonio Fern\'{a}ndez and Georgiou, Chryssis and Nicolaou, Nicolas}, title = {{Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {40:1--40:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.40}, URN = {urn:nbn:de:0030-drops-113476}, doi = {10.4230/LIPIcs.DISC.2019.40}, annote = {Keywords: Distributed Ledger Object, Byzantine Faults} }
Xavier Défago, Adam Heriban, Sébastien Tixeuil, and Koichi Wada. Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 41:1-41:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{defago_et_al:LIPIcs.DISC.2019.41, author = {D\'{e}fago, Xavier and Heriban, Adam and Tixeuil, S\'{e}bastien and Wada, Koichi}, title = {{Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {41:1--41:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.41}, URN = {urn:nbn:de:0030-drops-113487}, doi = {10.4230/LIPIcs.DISC.2019.41}, annote = {Keywords: Autonomous mobile robots, Rendezvous, Lights, Model Checking} }
Michael Dinitz and Yasamin Nazari. Brief Announcement: Massively Parallel Approximate Distance Sketches. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 42:1-42:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dinitz_et_al:LIPIcs.DISC.2019.42, author = {Dinitz, Michael and Nazari, Yasamin}, title = {{Brief Announcement: Massively Parallel Approximate Distance Sketches}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {42:1--42:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.42}, URN = {urn:nbn:de:0030-drops-113491}, doi = {10.4230/LIPIcs.DISC.2019.42}, annote = {Keywords: Distance Sketches, Massively Parallel Computation, Congested Clique} }
Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, and Koichi Wada. Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 43:1-43:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dolev_et_al:LIPIcs.DISC.2019.43, author = {Dolev, Shlomi and Kamei, Sayaka and Katayama, Yoshiaki and Ooshita, Fukuhito and Wada, Koichi}, title = {{Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {43:1--43:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.43}, URN = {urn:nbn:de:0030-drops-113504}, doi = {10.4230/LIPIcs.DISC.2019.43}, annote = {Keywords: neighborhood mutual remainder, self-stabilization, LCM robot} }
Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi. Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 44:1-44:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gupta_et_al:LIPIcs.DISC.2019.44, author = {Gupta, Suyash and Hellings, Jelle and Sadoghi, Mohammad}, title = {{Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {44:1--44:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.44}, URN = {urn:nbn:de:0030-drops-113514}, doi = {10.4230/LIPIcs.DISC.2019.44}, annote = {Keywords: Consensus, primary-backup, high-performance, wait-free parallelization} }
Jelle Hellings and Mohammad Sadoghi. Brief Announcement: The Fault-Tolerant Cluster-Sending Problem. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 45:1-45:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{hellings_et_al:LIPIcs.DISC.2019.45, author = {Hellings, Jelle and Sadoghi, Mohammad}, title = {{Brief Announcement: The Fault-Tolerant Cluster-Sending Problem}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {45:1--45:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.45}, URN = {urn:nbn:de:0030-drops-113528}, doi = {10.4230/LIPIcs.DISC.2019.45}, annote = {Keywords: Byzantine clusters, message sending, lower bound, optimal protocol} }
Masoomeh Javidi Kishi, Ahmed Hassan, and Roberto Palmieri. Brief Announcement: On the Correctness of Transaction Processing with External Dependency. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 46:1-46:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{javidikishi_et_al:LIPIcs.DISC.2019.46, author = {Javidi Kishi, Masoomeh and Hassan, Ahmed and Palmieri, Roberto}, title = {{Brief Announcement: On the Correctness of Transaction Processing with External Dependency}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {46:1--46:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.46}, URN = {urn:nbn:de:0030-drops-113539}, doi = {10.4230/LIPIcs.DISC.2019.46}, annote = {Keywords: Transactions, Dependency Graph, Concurrency} }
Chen-Da Liu-Zhang, Varun Maram, and Ueli Maurer. Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 47:1-47:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{liuzhang_et_al:LIPIcs.DISC.2019.47, author = {Liu-Zhang, Chen-Da and Maram, Varun and Maurer, Ueli}, title = {{Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {47:1--47:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.47}, URN = {urn:nbn:de:0030-drops-113540}, doi = {10.4230/LIPIcs.DISC.2019.47}, annote = {Keywords: broadcast, partial broadcast, minicast, general adversary, general network} }
Nancy Lynch and Mien Brabeeba Wang. Brief Announcement: Integrating Temporal Information to Spatial Information in a Neural Circuit. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 48:1-48:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{lynch_et_al:LIPIcs.DISC.2019.48, author = {Lynch, Nancy and Wang, Mien Brabeeba}, title = {{Brief Announcement: Integrating Temporal Information to Spatial Information in a Neural Circuit}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {48:1--48:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.48}, URN = {urn:nbn:de:0030-drops-113551}, doi = {10.4230/LIPIcs.DISC.2019.48}, annote = {Keywords: Spiking Neural Network, Distributed Algorithm, Biological Networks} }
Ali Mashreghi and Valerie King. Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 49:1-49:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{mashreghi_et_al:LIPIcs.DISC.2019.49, author = {Mashreghi, Ali and King, Valerie}, title = {{Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {49:1--49:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.49}, URN = {urn:nbn:de:0030-drops-113566}, doi = {10.4230/LIPIcs.DISC.2019.49}, annote = {Keywords: Distributed Computing, Minimum Spanning Tree, Broadcast Tree} }
Feedback for Dagstuhl Publishing