<h2>LIPIcs, Volume 179, DISC 2020</h2>
<ul>
<li>
<span class="authors">Hagit Attiya</span>
<span class="title">LIPIcs, Volume 179, DISC 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020">10.4230/LIPIcs.DISC.2020</a>
</li>
<li>
<span class="authors">Hagit Attiya</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.0">10.4230/LIPIcs.DISC.2020.0</a>
</li>
<li>
<span class="authors">Sepehr Assadi, Aaron Bernstein, and Zachary Langley</span>
<span class="title">Improved Bounds for Distributed Load Balancing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.1">10.4230/LIPIcs.DISC.2020.1</a>
</li>
<li>
<span class="authors">Arik Rinberg and Idit Keidar</span>
<span class="title">Intermediate Value Linearizability: A Quantitative Correctness Criterion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.2">10.4230/LIPIcs.DISC.2020.2</a>
</li>
<li>
<span class="authors">Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami</span>
<span class="title">The Splay-List: A Distribution-Adaptive Concurrent Skip-List</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.3">10.4230/LIPIcs.DISC.2020.3</a>
</li>
<li>
<span class="authors">Rachid Guerraoui, Alex Kogan, Virendra J. Marathe, and Igor Zablotchi</span>
<span class="title">Efficient Multi-Word Compare and Swap</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.4">10.4230/LIPIcs.DISC.2020.4</a>
</li>
<li>
<span class="authors">Guy E. Blelloch and Yuanhao Wei</span>
<span class="title">LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.5">10.4230/LIPIcs.DISC.2020.5</a>
</li>
<li>
<span class="authors">Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, and Eric Severson</span>
<span class="title">Message Complexity of Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.6">10.4230/LIPIcs.DISC.2020.6</a>
</li>
<li>
<span class="authors">Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, and Quentin Soubeyran</span>
<span class="title">Distributed Computation with Continual Population Growth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.7">10.4230/LIPIcs.DISC.2020.7</a>
</li>
<li>
<span class="authors">Aurélien Bellet, Rachid Guerraoui, and Hadrien Hendrikx</span>
<span class="title">Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.8">10.4230/LIPIcs.DISC.2020.8</a>
</li>
<li>
<span class="authors">George Giakkoupis, Hayk Saribekyan, and Thomas Sauerwald</span>
<span class="title">Spread of Information and Diseases via Random Walks in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.9">10.4230/LIPIcs.DISC.2020.9</a>
</li>
<li>
<span class="authors">Yael Hitron, Cameron Musco, and Merav Parter</span>
<span class="title">Spiking Neural Networks Through the Lens of Streaming Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.10">10.4230/LIPIcs.DISC.2020.10</a>
</li>
<li>
<span class="authors">Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, and Yasumasa Tamura</span>
<span class="title">Communication Efficient Self-Stabilizing Leader Election</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.11">10.4230/LIPIcs.DISC.2020.11</a>
</li>
<li>
<span class="authors">Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta, and Yukiko Yamauchi</span>
<span class="title">Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.12">10.4230/LIPIcs.DISC.2020.12</a>
</li>
<li>
<span class="authors">Sebastian Brandt, Julian Portmann, and Jara Uitto</span>
<span class="title">Tight Bounds for Deterministic High-Dimensional Grid Exploration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.13">10.4230/LIPIcs.DISC.2020.13</a>
</li>
<li>
<span class="authors">Guy Goren, Shay Vargaftik, and Yoram Moses</span>
<span class="title">Distributed Dispatching in the Parallel Server Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.14">10.4230/LIPIcs.DISC.2020.14</a>
</li>
<li>
<span class="authors">Hsin-Hao Su and Hoa T. Vu</span>
<span class="title">Distributed Dense Subgraph Detection and Low Outdegree Orientation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.15">10.4230/LIPIcs.DISC.2020.15</a>
</li>
<li>
<span class="authors">Yannic Maus and Tigran Tonoyan</span>
<span class="title">Local Conflict Coloring Revisited: Linial for Lists</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.16">10.4230/LIPIcs.DISC.2020.16</a>
</li>
<li>
<span class="authors">Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, and Jukka Suomela</span>
<span class="title">Classification of Distributed Binary Labeling Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.17">10.4230/LIPIcs.DISC.2020.17</a>
</li>
<li>
<span class="authors">Yi-Jun Chang</span>
<span class="title">The Complexity Landscape of Distributed Locally Checkable Problems on Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.18">10.4230/LIPIcs.DISC.2020.18</a>
</li>
<li>
<span class="authors">Ofer Grossman, Seri Khoury, and Ami Paz</span>
<span class="title">Improved Hardness of Approximation of Diameter in the CONGEST Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.19">10.4230/LIPIcs.DISC.2020.19</a>
</li>
<li>
<span class="authors">Yuval Emek and Yuval Gil</span>
<span class="title">Twenty-Two New Approximate Proof Labeling Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.20">10.4230/LIPIcs.DISC.2020.20</a>
</li>
<li>
<span class="authors">Merav Parter</span>
<span class="title">Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.21">10.4230/LIPIcs.DISC.2020.21</a>
</li>
<li>
<span class="authors">Shay Kutten, William K. Moses Jr., Gopal Pandurangan, and David Peleg</span>
<span class="title">Singularly Optimal Randomized Leader Election</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.22">10.4230/LIPIcs.DISC.2020.22</a>
</li>
<li>
<span class="authors">Manuel Bravo, Gregory Chockler, and Alexey Gotsman</span>
<span class="title">Making Byzantine Consensus Live</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.23">10.4230/LIPIcs.DISC.2020.23</a>
</li>
<li>
<span class="authors">Tuanir França Rezende and Pierre Sutra</span>
<span class="title">Leaderless State-Machine Replication: Specification, Properties, Limits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.24">10.4230/LIPIcs.DISC.2020.24</a>
</li>
<li>
<span class="authors">Shir Cohen, Idit Keidar, and Alexander Spiegelman</span>
<span class="title">Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.25">10.4230/LIPIcs.DISC.2020.25</a>
</li>
<li>
<span class="authors">Oded Naor and Idit Keidar</span>
<span class="title">Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.26">10.4230/LIPIcs.DISC.2020.26</a>
</li>
<li>
<span class="authors">Petr Kuznetsov and Andrei Tonkikh</span>
<span class="title">Asynchronous Reconfiguration with Byzantine Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.27">10.4230/LIPIcs.DISC.2020.27</a>
</li>
<li>
<span class="authors">Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, and Zhuolun Xiang</span>
<span class="title">Improved Extension Protocols for Byzantine Broadcast and Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.28">10.4230/LIPIcs.DISC.2020.28</a>
</li>
<li>
<span class="authors">Diana Ghinea, Martin Hirt, and Chen-Da Liu-Zhang</span>
<span class="title">From Partial to Global Asynchronous Reliable Broadcast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.29">10.4230/LIPIcs.DISC.2020.29</a>
</li>
<li>
<span class="authors">Bogdan S. Chlebus, Dariusz R. Kowalski, and Jan Olkowski</span>
<span class="title">Fast Agreement in Networks with Byzantine Nodes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.30">10.4230/LIPIcs.DISC.2020.30</a>
</li>
<li>
<span class="authors">John Augustine, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, and Jared Saia</span>
<span class="title">Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.31">10.4230/LIPIcs.DISC.2020.31</a>
</li>
<li>
<span class="authors">Xiong Zheng and Vijay Garg</span>
<span class="title">Byzantine Lattice Agreement in Synchronous Message Passing Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.32">10.4230/LIPIcs.DISC.2020.32</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, and Rotem Oshman</span>
<span class="title">Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.33">10.4230/LIPIcs.DISC.2020.33</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari, Christoph Grunau, and Ce Jin</span>
<span class="title">Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.34">10.4230/LIPIcs.DISC.2020.34</a>
</li>
<li>
<span class="authors">Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, and Gregory Schwartzman</span>
<span class="title">Improved Distributed Approximations for Maximum Independent Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.35">10.4230/LIPIcs.DISC.2020.35</a>
</li>
<li>
<span class="authors">Uri Meir, Ami Paz, and Gregory Schwartzman</span>
<span class="title">Models of Smoothing in Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.36">10.4230/LIPIcs.DISC.2020.36</a>
</li>
<li>
<span class="authors">Mohamad Ahmadi and Fabian Kuhn</span>
<span class="title">Distributed Maximum Matching Verification in CONGEST</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.37">10.4230/LIPIcs.DISC.2020.37</a>
</li>
<li>
<span class="authors">Merav Parter</span>
<span class="title">Distributed Planar Reachability in Nearly Optimal Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.38">10.4230/LIPIcs.DISC.2020.38</a>
</li>
<li>
<span class="authors">Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Alexandre Nolin</span>
<span class="title">Coloring Fast Without Learning Your Neighbors' Colors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.39">10.4230/LIPIcs.DISC.2020.39</a>
</li>
<li>
<span class="authors">Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto</span>
<span class="title">Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.40">10.4230/LIPIcs.DISC.2020.40</a>
</li>
<li>
<span class="authors">Yi-Jun Chang, Jan Studený, and Jukka Suomela</span>
<span class="title">Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.41">10.4230/LIPIcs.DISC.2020.41</a>
</li>
<li>
<span class="authors">Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, and Sara Rizzo</span>
<span class="title">Brief Announcement: Phase Transitions of the k-Majority Dynamics in a Biased Communication Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.42">10.4230/LIPIcs.DISC.2020.42</a>
</li>
<li>
<span class="authors">Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, and Ami Paz</span>
<span class="title">Brief Announcement: Distributed Quantum Proofs for Replicated Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.43">10.4230/LIPIcs.DISC.2020.43</a>
</li>
<li>
<span class="authors">Ashish Choudhury</span>
<span class="title">Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.44">10.4230/LIPIcs.DISC.2020.44</a>
</li>
<li>
<span class="authors">Pierre Civit, Seth Gilbert, and Vincent Gramoli</span>
<span class="title">Brief Announcement: Polygraph: Accountable Byzantine Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.45">10.4230/LIPIcs.DISC.2020.45</a>
</li>
<li>
<span class="authors">Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tredan</span>
<span class="title">Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.46">10.4230/LIPIcs.DISC.2020.46</a>
</li>
<li>
<span class="authors">Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang</span>
<span class="title">Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.47">10.4230/LIPIcs.DISC.2020.47</a>
</li>
<li>
<span class="authors">Martin Hirt, Ard Kastrati, and Chen-Da Liu-Zhang</span>
<span class="title">Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.48">10.4230/LIPIcs.DISC.2020.48</a>
</li>
<li>
<span class="authors">Paolo Zappalà, Marianna Belotti, Maria Potop-Butucaru, and Stefano Secci</span>
<span class="title">Brief Announcement: Game Theoretical Framework for Analyzing Blockchains Robustness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.49">10.4230/LIPIcs.DISC.2020.49</a>
</li>
<li>
<span class="authors">Dolev Adas and Roy Friedman</span>
<span class="title">Brief Announcement: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.50">10.4230/LIPIcs.DISC.2020.50</a>
</li>
<li>
<span class="authors">Guy E. Blelloch and Yuanhao Wei</span>
<span class="title">Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.51">10.4230/LIPIcs.DISC.2020.51</a>
</li>
<li>
<span class="authors">Haosen Wen, Wentao Cai, Mingzhe Du, Benjamin Valpey, and Michael L. Scott</span>
<span class="title">Brief Announcement: Building Fast Recoverable Persistent Data Structures with Montage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.52">10.4230/LIPIcs.DISC.2020.52</a>
</li>
<li>
<span class="authors">Lewis Tseng, Qinzi Zhang, and Yifan Zhang</span>
<span class="title">Brief Announcement: Reaching Approximate Consensus When Everyone May Crash</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.53">10.4230/LIPIcs.DISC.2020.53</a>
</li>
<li>
<span class="authors">Petr Kuznetsov and Thibault Rieutord</span>
<span class="title">Brief Announcement: On Decidability of 2-Process Affine Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2020.54">10.4230/LIPIcs.DISC.2020.54</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