<h2>LIPIcs, Volume 121, DISC 2018</h2>
<ul>
<li>
<span class="authors">Ulrich Schmid and Josef Widder</span>
<span class="title">LIPIcs, Volume 121, DISC'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018">10.4230/LIPIcs.DISC.2018</a>
</li>
<li>
<span class="authors">Ulrich Schmid and Josef Widder</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization, Awards</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.0">10.4230/LIPIcs.DISC.2018.0</a>
</li>
<li>
<span class="authors">Sándor P. Fekete</span>
<span class="title">Autonomous Vehicles: From Individual Navigation to Challenges of Distributed Swarms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.1">10.4230/LIPIcs.DISC.2018.1</a>
</li>
<li>
<span class="authors">Tom Goldstein</span>
<span class="title">Challenges for Machine Learning on Distributed Platforms (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.2">10.4230/LIPIcs.DISC.2018.2</a>
</li>
<li>
<span class="authors">Michael Mendler</span>
<span class="title">Logical Analysis of Distributed Systems: The Importance of Being Constructive (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.3">10.4230/LIPIcs.DISC.2018.3</a>
</li>
<li>
<span class="authors">Yehuda Afek, Yuval Emek, and Noa Kolikant</span>
<span class="title">Selecting a Leader in a Network of Finite State Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.4">10.4230/LIPIcs.DISC.2018.4</a>
</li>
<li>
<span class="authors">Yehuda Afek, Shaked Rafaeli, and Moshe Sulamy</span>
<span class="title">The Role of A-priori Information in Networks of Rational Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.5">10.4230/LIPIcs.DISC.2018.5</a>
</li>
<li>
<span class="authors">Mohamad Ahmadi, Fabian Kuhn, and Rotem Oshman</span>
<span class="title">Distributed Approximate Maximum Matching in the CONGEST Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.6">10.4230/LIPIcs.DISC.2018.6</a>
</li>
<li>
<span class="authors">Karolos Antoniadis, Rachid Guerraoui, Dahlia Malkhi, and Dragos-Adrian Seredinschi</span>
<span class="title">State Machine Replication Is More Expensive Than Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.7">10.4230/LIPIcs.DISC.2018.7</a>
</li>
<li>
<span class="authors">James Aspnes, Bernhard Haeupler, Alexander Tong, and Philipp Woelfel</span>
<span class="title">Allocate-On-Use Space Complexity of Shared-Memory Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.8">10.4230/LIPIcs.DISC.2018.8</a>
</li>
<li>
<span class="authors">Alkida Balliu, Sebastian Brandt, Dennis Olivetti, and Jukka Suomela</span>
<span class="title">Almost Global Problems in the LOCAL Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.9">10.4230/LIPIcs.DISC.2018.9</a>
</li>
<li>
<span class="authors">Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, and Tomasz Radzik</span>
<span class="title">A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.10">10.4230/LIPIcs.DISC.2018.10</a>
</li>
<li>
<span class="authors">Alon Berger, Idit Keidar, and Alexander Spiegelman</span>
<span class="title">Integrated Bounds for Disintegrated Storage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.11">10.4230/LIPIcs.DISC.2018.11</a>
</li>
<li>
<span class="authors">Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, and Jara Uitto</span>
<span class="title">Distributed Recoloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.12">10.4230/LIPIcs.DISC.2018.12</a>
</li>
<li>
<span class="authors">Sebastian Brandt, Jara Uitto, and Roger Wattenhofer</span>
<span class="title">A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.13">10.4230/LIPIcs.DISC.2018.13</a>
</li>
<li>
<span class="authors">Gregory Chockler and Alexey Gotsman</span>
<span class="title">Multi-Shot Distributed Transaction Commit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.14">10.4230/LIPIcs.DISC.2018.14</a>
</li>
<li>
<span class="authors">Artur Czumaj and Peter Davies</span>
<span class="title">Deterministic Blind Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.15">10.4230/LIPIcs.DISC.2018.15</a>
</li>
<li>
<span class="authors">Artur Czumaj and Christian Konrad</span>
<span class="title">Detecting Cliques in CONGEST Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.16">10.4230/LIPIcs.DISC.2018.16</a>
</li>
<li>
<span class="authors">Eli Daian, Giuliano Losa, Yehuda Afek, and Eli Gafni</span>
<span class="title">A Wealth of Sub-Consensus Deterministic Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.17">10.4230/LIPIcs.DISC.2018.17</a>
</li>
<li>
<span class="authors">Henry Daly, Ahmed Hassan, Michael F. Spear, and Roberto Palmieri</span>
<span class="title">NUMASK: High Performance Scalable Skip List for NUMA</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.18">10.4230/LIPIcs.DISC.2018.18</a>
</li>
<li>
<span class="authors">Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, and Giovanni Viglietta</span>
<span class="title">TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and Its Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.19">10.4230/LIPIcs.DISC.2018.19</a>
</li>
<li>
<span class="authors">Fabien Dufoulon, Janna Burman, and Joffroy Beauquier</span>
<span class="title">Beeping a Deterministic Time-Optimal Leader Election</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.20">10.4230/LIPIcs.DISC.2018.20</a>
</li>
<li>
<span class="authors">Aryaz Eghbali and Philipp Woelfel</span>
<span class="title">An Almost Tight RMR Lower Bound for Abortable Test-And-Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.21">10.4230/LIPIcs.DISC.2018.21</a>
</li>
<li>
<span class="authors">Guy Even, Mohsen Ghaffari, and Moti Medina</span>
<span class="title">Distributed Set Cover Approximation: Primal-Dual with Optimal Locality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.22">10.4230/LIPIcs.DISC.2018.22</a>
</li>
<li>
<span class="authors">Yotam M. Y. Feldman, Constantin Enea, Adam Morrison, Noam Rinetzky, and Sharon Shoham</span>
<span class="title">Order out of Chaos: Proving Linearizability Using Local Views</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.23">10.4230/LIPIcs.DISC.2018.23</a>
</li>
<li>
<span class="authors">Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, and Mor Perry</span>
<span class="title">Redundancy in Distributed Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.24">10.4230/LIPIcs.DISC.2018.24</a>
</li>
<li>
<span class="authors">Laurent Feuilloley and Juho Hirvonen</span>
<span class="title">Local Verification of Global Proofs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.25">10.4230/LIPIcs.DISC.2018.25</a>
</li>
<li>
<span class="authors">Manuela Fischer and Mohsen Ghaffari</span>
<span class="title">A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.26">10.4230/LIPIcs.DISC.2018.26</a>
</li>
<li>
<span class="authors">Matthias Függer and Thomas Nowak</span>
<span class="title">Fast Multidimensional Asymptotic and Approximate Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.27">10.4230/LIPIcs.DISC.2018.27</a>
</li>
<li>
<span class="authors">Pawel Garncarek, Tomasz Jurdzinski, and Dariusz R. Kowalski</span>
<span class="title">Local Queuing Under Contention</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.28">10.4230/LIPIcs.DISC.2018.28</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari and Fabian Kuhn</span>
<span class="title">Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.29">10.4230/LIPIcs.DISC.2018.29</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari and Fabian Kuhn</span>
<span class="title">Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.30">10.4230/LIPIcs.DISC.2018.30</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari and Jason Li</span>
<span class="title">New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.31">10.4230/LIPIcs.DISC.2018.31</a>
</li>
<li>
<span class="authors">Robert Gmyr and Gopal Pandurangan</span>
<span class="title">Time-Message Trade-Offs in Distributed Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.32">10.4230/LIPIcs.DISC.2018.32</a>
</li>
<li>
<span class="authors">Bernhard Haeupler and Jason Li</span>
<span class="title">Faster Distributed Shortest Path Approximations via Shortcuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.33">10.4230/LIPIcs.DISC.2018.33</a>
</li>
<li>
<span class="authors">Yael Tauman Kalai, Ilan Komargodski, and Ran Raz</span>
<span class="title">A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.34">10.4230/LIPIcs.DISC.2018.34</a>
</li>
<li>
<span class="authors">Ken-ichi Kawarabayashi and Gregory Schwartzman</span>
<span class="title">Adapting Local Sequential Algorithms to the Distributed Setting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.35">10.4230/LIPIcs.DISC.2018.35</a>
</li>
<li>
<span class="authors">Julian Loss, Ueli Maurer, and Daniel Tschudi</span>
<span class="title">Strong Separations Between Broadcast and Authenticated Channels</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.36">10.4230/LIPIcs.DISC.2018.36</a>
</li>
<li>
<span class="authors">Ali Mashreghi and Valerie King</span>
<span class="title">Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.37">10.4230/LIPIcs.DISC.2018.37</a>
</li>
<li>
<span class="authors">Calvin Newport and Peter Robinson</span>
<span class="title">Fault-Tolerant Consensus with an Abstract MAC Layer</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.38">10.4230/LIPIcs.DISC.2018.38</a>
</li>
<li>
<span class="authors">Merav Parter and Hsin-Hao Su</span>
<span class="title">Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.39">10.4230/LIPIcs.DISC.2018.39</a>
</li>
<li>
<span class="authors">Merav Parter and Eylon Yogev</span>
<span class="title">Congested Clique Algorithms for Graph Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.40">10.4230/LIPIcs.DISC.2018.40</a>
</li>
<li>
<span class="authors">Xiong Zheng, Changyong Hu, and Vijay K. Garg</span>
<span class="title">Lattice Agreement in Message Passing Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.41">10.4230/LIPIcs.DISC.2018.41</a>
</li>
<li>
<span class="authors">Philipp Bamberger, Fabian Kuhn, and Yannic Maus</span>
<span class="title">Brief Announcement: Local Distributed Algorithms in Highly Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.42">10.4230/LIPIcs.DISC.2018.42</a>
</li>
<li>
<span class="authors">Artur Czumaj and Peter Davies</span>
<span class="title">Brief Announcement: Randomized Blind Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.43">10.4230/LIPIcs.DISC.2018.43</a>
</li>
<li>
<span class="authors">Gianluca De Marco, Dariusz R. Kowalski, and Grzegorz Stachowiak</span>
<span class="title">Brief Announcement: Deterministic Contention Resolution on a Shared Channel</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.44">10.4230/LIPIcs.DISC.2018.44</a>
</li>
<li>
<span class="authors">Simon Doherty, Brijesh Dongol, Heike Wehrheim, and John Derrick</span>
<span class="title">Brief Announcement: Generalising Concurrent Correctness to Weak Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.45">10.4230/LIPIcs.DISC.2018.45</a>
</li>
<li>
<span class="authors">David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, and Michail Theofilatos</span>
<span class="title">Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.46">10.4230/LIPIcs.DISC.2018.46</a>
</li>
<li>
<span class="authors">Reginald Frank and Jennifer L. Welch</span>
<span class="title">Brief Announcement: A Tight Lower Bound for Clock Synchronization in Odd-Ary M-Toroids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.47">10.4230/LIPIcs.DISC.2018.47</a>
</li>
<li>
<span class="authors">Seth Gilbert, Nancy Lynch, Calvin Newport, and Dominik Pajak</span>
<span class="title">Brief Announcement: On Simple Back-Off in Unreliable Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.48">10.4230/LIPIcs.DISC.2018.48</a>
</li>
<li>
<span class="authors">Shreyas Gokhale and Neeraj Mittal</span>
<span class="title">Brief Announcement: Fast and Scalable Group Mutual Exclusion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.49">10.4230/LIPIcs.DISC.2018.49</a>
</li>
<li>
<span class="authors">Éric Goubault, Jérémy Ledent, and Samuel Mimram</span>
<span class="title">Brief Announcement: On the Impossibility of Detecting Concurrency</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.50">10.4230/LIPIcs.DISC.2018.50</a>
</li>
<li>
<span class="authors">Dimitris Sakavalas, Lewis Tseng, and Nitin H. Vaidya</span>
<span class="title">Brief Announcement: Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.51">10.4230/LIPIcs.DISC.2018.51</a>
</li>
<li>
<span class="authors">Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa</span>
<span class="title">Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2018.52">10.4230/LIPIcs.DISC.2018.52</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