<h2>LIPIcs, Volume 146, DISC 2019</h2>
<ul>
<li>
<span class="authors">Jukka Suomela</span>
<span class="title">LIPIcs, Volume 146, DISC'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019">10.4230/LIPIcs.DISC.2019</a>
</li>
<li>
<span class="authors">Jukka Suomela</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.0">10.4230/LIPIcs.DISC.2019.0</a>
</li>
<li>
<span class="authors">James Aspnes and He Yang Er</span>
<span class="title">Consensus with Max Registers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.1">10.4230/LIPIcs.DISC.2019.1</a>
</li>
<li>
<span class="authors">Hagit Attiya and Constantin Enea</span>
<span class="title">Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs That Use Concurrent Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.2">10.4230/LIPIcs.DISC.2019.2</a>
</li>
<li>
<span class="authors">Mirza Ahad Baig, Danny Hendler, Alessia Milani, and Corentin Travers</span>
<span class="title">Long-Lived Counters with Polylogarithmic Amortized Step Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.3">10.4230/LIPIcs.DISC.2019.3</a>
</li>
<li>
<span class="authors">Ruben Becker, Yuval Emek, Mohsen Ghaffari, and Christoph Lenzen</span>
<span class="title">Distributed Algorithms for Low Stretch Spanning Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.4">10.4230/LIPIcs.DISC.2019.4</a>
</li>
<li>
<span class="authors">Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, and Gregory Schwartzman</span>
<span class="title">Optimal Distributed Covering Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.5">10.4230/LIPIcs.DISC.2019.5</a>
</li>
<li>
<span class="authors">Ran Ben-Basat, Ken-ichi Kawarabayashi, and Gregory Schwartzman</span>
<span class="title">Parameterized Distributed Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.6">10.4230/LIPIcs.DISC.2019.6</a>
</li>
<li>
<span class="authors">Shimon Bitton, Yuval Emek, Taisuke Izumi, and Shay Kutten</span>
<span class="title">Message Reduction in the LOCAL Model Is a Free Lunch</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.7">10.4230/LIPIcs.DISC.2019.7</a>
</li>
<li>
<span class="authors">Mark Braverman, Gillat Kol, Rotem Oshman, and Avishay Tal</span>
<span class="title">On the Computational Power of Radio Channels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.8">10.4230/LIPIcs.DISC.2019.8</a>
</li>
<li>
<span class="authors">Janna Burman, Joffroy Beauquier, and Devan Sohier</span>
<span class="title">Space-Optimal Naming in Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.9">10.4230/LIPIcs.DISC.2019.9</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, and Goran Zuzic</span>
<span class="title">Erasure Correction for Noisy Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.10">10.4230/LIPIcs.DISC.2019.10</a>
</li>
<li>
<span class="authors">Shiri Chechik and Doron Mukhtar</span>
<span class="title">Reachability and Shortest Paths in the Broadcast CONGEST Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.11">10.4230/LIPIcs.DISC.2019.11</a>
</li>
<li>
<span class="authors">Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, and Alex Samorodnitsky</span>
<span class="title">On the Round Complexity of Randomized Byzantine Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.12">10.4230/LIPIcs.DISC.2019.12</a>
</li>
<li>
<span class="authors">Pierluigi Crescenzi, Pierre Fraigniaud, and Ami Paz</span>
<span class="title">Trade-Offs in Distributed Interactive Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.13">10.4230/LIPIcs.DISC.2019.13</a>
</li>
<li>
<span class="authors">Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, and Alex Weaver</span>
<span class="title">The Capacity of Smartphone Peer-To-Peer Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.14">10.4230/LIPIcs.DISC.2019.14</a>
</li>
<li>
<span class="authors">Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, and Rotem Oshman</span>
<span class="title">Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.15">10.4230/LIPIcs.DISC.2019.15</a>
</li>
<li>
<span class="authors">Orr Fischer and Rotem Oshman</span>
<span class="title">A Distributed Algorithm for Directed Minimum-Weight Spanning Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.16">10.4230/LIPIcs.DISC.2019.16</a>
</li>
<li>
<span class="authors">Paweł Garncarek, Tomasz Jurdziński, and Dariusz R. Kowalski</span>
<span class="title">Stable Memoryless Queuing under Contention</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.17">10.4230/LIPIcs.DISC.2019.17</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari and Julian Portmann</span>
<span class="title">Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.18">10.4230/LIPIcs.DISC.2019.18</a>
</li>
<li>
<span class="authors">Seth Gilbert, James Maguire, and Calvin Newport</span>
<span class="title">On Bioelectric Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.19">10.4230/LIPIcs.DISC.2019.19</a>
</li>
<li>
<span class="authors">Seth Gilbert and Wei Quan Lim</span>
<span class="title">Parallel Finger Search Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.20">10.4230/LIPIcs.DISC.2019.20</a>
</li>
<li>
<span class="authors">Éric Goubault, Marijana Lazić, Jérémy Ledent, and Sergio Rajsbaum</span>
<span class="title">Wait-Free Solvability of Equality Negation Tasks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.21">10.4230/LIPIcs.DISC.2019.21</a>
</li>
<li>
<span class="authors">Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-Adrian Seredinschi</span>
<span class="title">Scalable Byzantine Reliable Broadcast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.22">10.4230/LIPIcs.DISC.2019.22</a>
</li>
<li>
<span class="authors">Kristian Hinnenthal, Christian Scheideler, and Martijn Struijs</span>
<span class="title">Fast Distributed Algorithms for LP-Type Problems of Low Dimension</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.23">10.4230/LIPIcs.DISC.2019.23</a>
</li>
<li>
<span class="authors">Artem Khyzha, Hagit Attiya, and Alexey Gotsman</span>
<span class="title">Privatization-Safe Transactional Memories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.24">10.4230/LIPIcs.DISC.2019.24</a>
</li>
<li>
<span class="authors">Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, and Taisuke Izumi</span>
<span class="title">Low-Congestion Shortcut and Graph Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.25">10.4230/LIPIcs.DISC.2019.25</a>
</li>
<li>
<span class="authors">Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, and Peter Robinson</span>
<span class="title">The Complexity of Symmetry Breaking in Massive Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.26">10.4230/LIPIcs.DISC.2019.26</a>
</li>
<li>
<span class="authors">Giuliano Losa, Eli Gafni, and David Mazières</span>
<span class="title">Stellar Consensus by Instantiation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.27">10.4230/LIPIcs.DISC.2019.27</a>
</li>
<li>
<span class="authors">Ruslan Nikolaev</span>
<span class="title">A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.28">10.4230/LIPIcs.DISC.2019.28</a>
</li>
<li>
<span class="authors">Thomas Nowak and Joel Rybicki</span>
<span class="title">Byzantine Approximate Agreement on Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.29">10.4230/LIPIcs.DISC.2019.29</a>
</li>
<li>
<span class="authors">Merav Parter</span>
<span class="title">Small Cuts and Connectivity Certificates: A Fault Tolerant Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.30">10.4230/LIPIcs.DISC.2019.30</a>
</li>
<li>
<span class="authors">Adones Rukundo, Aras Atalar, and Philippas Tsigas</span>
<span class="title">Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design Framework</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.31">10.4230/LIPIcs.DISC.2019.31</a>
</li>
<li>
<span class="authors">Nobutaka Shimizu and Takeharu Shiraga</span>
<span class="title">Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.32">10.4230/LIPIcs.DISC.2019.32</a>
</li>
<li>
<span class="authors">Hsin-Hao Su and Hoa T. Vu</span>
<span class="title">Distributed Data Summarization in Well-Connected Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.33">10.4230/LIPIcs.DISC.2019.33</a>
</li>
<li>
<span class="authors">Mohammad Taheri, Arash Pourdamghani, and Mohsen Lesani</span>
<span class="title">Polynomial-Time Fence Insertion for Structured Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.34">10.4230/LIPIcs.DISC.2019.34</a>
</li>
<li>
<span class="authors">Chen Avin, Iosif Salem, and Stefan Schmid</span>
<span class="title">Brief Announcement: On Self-Adjusting Skip List Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.35">10.4230/LIPIcs.DISC.2019.35</a>
</li>
<li>
<span class="authors">Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, and Hamed Saleh</span>
<span class="title">Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.36">10.4230/LIPIcs.DISC.2019.36</a>
</li>
<li>
<span class="authors">Lélia Blin, Laurent Feuilloley, and Gabriel Le Bouder</span>
<span class="title">Brief Announcement: Memory Lower Bounds for Self-Stabilization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.37">10.4230/LIPIcs.DISC.2019.37</a>
</li>
<li>
<span class="authors">Grégoire Bonin, Achour Mostéfaoui, and Matthieu Perrin</span>
<span class="title">Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.38">10.4230/LIPIcs.DISC.2019.38</a>
</li>
<li>
<span class="authors">Christian Cachin and Björn Tackmann</span>
<span class="title">Brief Announcement: Asymmetric Distributed Trust</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.39">10.4230/LIPIcs.DISC.2019.39</a>
</li>
<li>
<span class="authors">Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, and Nicolas Nicolaou</span>
<span class="title">Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.40">10.4230/LIPIcs.DISC.2019.40</a>
</li>
<li>
<span class="authors">Xavier Défago, Adam Heriban, Sébastien Tixeuil, and Koichi Wada</span>
<span class="title">Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.41">10.4230/LIPIcs.DISC.2019.41</a>
</li>
<li>
<span class="authors">Michael Dinitz and Yasamin Nazari</span>
<span class="title">Brief Announcement: Massively Parallel Approximate Distance Sketches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.42">10.4230/LIPIcs.DISC.2019.42</a>
</li>
<li>
<span class="authors">Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, and Koichi Wada</span>
<span class="title">Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.43">10.4230/LIPIcs.DISC.2019.43</a>
</li>
<li>
<span class="authors">Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi</span>
<span class="title">Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.44">10.4230/LIPIcs.DISC.2019.44</a>
</li>
<li>
<span class="authors">Jelle Hellings and Mohammad Sadoghi</span>
<span class="title">Brief Announcement: The Fault-Tolerant Cluster-Sending Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.45">10.4230/LIPIcs.DISC.2019.45</a>
</li>
<li>
<span class="authors">Masoomeh Javidi Kishi, Ahmed Hassan, and Roberto Palmieri</span>
<span class="title">Brief Announcement: On the Correctness of Transaction Processing with External Dependency</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.46">10.4230/LIPIcs.DISC.2019.46</a>
</li>
<li>
<span class="authors">Chen-Da Liu-Zhang, Varun Maram, and Ueli Maurer</span>
<span class="title">Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.47">10.4230/LIPIcs.DISC.2019.47</a>
</li>
<li>
<span class="authors">Nancy Lynch and Mien Brabeeba Wang</span>
<span class="title">Brief Announcement: Integrating Temporal Information to Spatial Information in a Neural Circuit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.48">10.4230/LIPIcs.DISC.2019.48</a>
</li>
<li>
<span class="authors">Ali Mashreghi and Valerie King</span>
<span class="title">Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2019.49">10.4230/LIPIcs.DISC.2019.49</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing