<h2>LIPIcs, Volume 91, DISC 2017</h2>
<ul>
<li>
<span class="authors">Andréa W. Richa</span>
<span class="title">LIPIcs, Volume 91, DISC'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017">10.4230/LIPIcs.DISC.2017</a>
</li>
<li>
<span class="authors">Andréa Richa</span>
<span class="title">Front Matter, Table of Contents, Preface, Symposium Organization, Awards</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.0">10.4230/LIPIcs.DISC.2017.0</a>
</li>
<li>
<span class="authors">Christian Cachin and Marko Vukolic</span>
<span class="title">Blockchain Consensus Protocols in the Wild (Keynote Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.1">10.4230/LIPIcs.DISC.2017.1</a>
</li>
<li>
<span class="authors">Anne-Marie Kermarrec</span>
<span class="title">Recommenders: from the Lab to the Wild (Keynote Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.2">10.4230/LIPIcs.DISC.2017.2</a>
</li>
<li>
<span class="authors">Dana Randall</span>
<span class="title">Phase Transitions and Emergent Phenomena in Random Structures and Algorithms (Keynote Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.3">10.4230/LIPIcs.DISC.2017.3</a>
</li>
<li>
<span class="authors">Maya Arbel-Raviv and Trevor Brown</span>
<span class="title">Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.4">10.4230/LIPIcs.DISC.2017.4</a>
</li>
<li>
<span class="authors">Chen Avin, Kaushik Mondal, and Stefan Schmid</span>
<span class="title">Demand-Aware Network Designs of Bounded Degree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.5">10.4230/LIPIcs.DISC.2017.5</a>
</li>
<li>
<span class="authors">Alkida Balliu and Pierre Fraigniaud</span>
<span class="title">Certification of Compact Low-Stretch Routing Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.6">10.4230/LIPIcs.DISC.2017.6</a>
</li>
<li>
<span class="authors">Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, and Christoph Lenzen</span>
<span class="title">Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.7">10.4230/LIPIcs.DISC.2017.7</a>
</li>
<li>
<span class="authors">Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, and Franck Petit</span>
<span class="title">Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.8">10.4230/LIPIcs.DISC.2017.8</a>
</li>
<li>
<span class="authors">Trevor Brown and Srivatsan Ravi</span>
<span class="title">Cost of Concurrency in Hybrid Transactional Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.9">10.4230/LIPIcs.DISC.2017.9</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Seri Khoury, and Ami Paz</span>
<span class="title">Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.10">10.4230/LIPIcs.DISC.2017.10</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Merav Parter, and Gregory Schwartzman</span>
<span class="title">Derandomizing Local Distributed Algorithms under Bandwidth Restrictions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.11">10.4230/LIPIcs.DISC.2017.11</a>
</li>
<li>
<span class="authors">David Yu Cheng Chan, Vassos Hadzilacos, and Sam Toueg</span>
<span class="title">On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.12">10.4230/LIPIcs.DISC.2017.12</a>
</li>
<li>
<span class="authors">Colin Cooper, Tomasz Radzik, Nicolás Rivera, and Takeharu Shiraga</span>
<span class="title">Fast Plurality Consensus in Regular Expanders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.13">10.4230/LIPIcs.DISC.2017.13</a>
</li>
<li>
<span class="authors">Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita</span>
<span class="title">Meeting in a Polygon by Anonymous Oblivious Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.14">10.4230/LIPIcs.DISC.2017.14</a>
</li>
<li>
<span class="authors">Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, and Ioan Todinca</span>
<span class="title">Three Notes on Distributed Property Testing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.15">10.4230/LIPIcs.DISC.2017.15</a>
</li>
<li>
<span class="authors">Laurent Feuilloley and Pierre Fraigniaud</span>
<span class="title">Error-Sensitive Proof-Labeling Schemes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.16">10.4230/LIPIcs.DISC.2017.16</a>
</li>
<li>
<span class="authors">Manuela Fischer</span>
<span class="title">Improved Deterministic Distributed Matching via Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.17">10.4230/LIPIcs.DISC.2017.17</a>
</li>
<li>
<span class="authors">Manuela Fischer and Mohsen Ghaffari</span>
<span class="title">Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.18">10.4230/LIPIcs.DISC.2017.18</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, and Jara Uitto</span>
<span class="title">Improved Distributed Degree Splitting and Edge Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.19">10.4230/LIPIcs.DISC.2017.19</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari and Christiana Lymouri</span>
<span class="title">Simple and Near-Optimal Distributed Coloring for Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.20">10.4230/LIPIcs.DISC.2017.20</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari and Merav Parter</span>
<span class="title">Near-Optimal Distributed DFS in Planar Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.21">10.4230/LIPIcs.DISC.2017.21</a>
</li>
<li>
<span class="authors">Abdolhamid Ghodselahi and Fabian Kuhn</span>
<span class="title">Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.22">10.4230/LIPIcs.DISC.2017.22</a>
</li>
<li>
<span class="authors">Alexey Gotsman and Sebastian Burckhardt</span>
<span class="title">Consistency Models with Global Operation Sequencing and their Composition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.23">10.4230/LIPIcs.DISC.2017.23</a>
</li>
<li>
<span class="authors">Ofer Grossman and Merav Parter</span>
<span class="title">Improved Deterministic Distributed Construction of Spanners</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.24">10.4230/LIPIcs.DISC.2017.24</a>
</li>
<li>
<span class="authors">Magnús M. Halldórsson, Fabian Kuhn, Nancy Lynch, and Calvin Newport</span>
<span class="title">An Efficient Communication Abstraction for Dense Wireless Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.25">10.4230/LIPIcs.DISC.2017.25</a>
</li>
<li>
<span class="authors">Itay Hazan and Eyal Kushilevitz</span>
<span class="title">Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.26">10.4230/LIPIcs.DISC.2017.26</a>
</li>
<li>
<span class="authors">Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal</span>
<span class="title">Which Broadcast Abstraction Captures k-Set Agreement?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.27">10.4230/LIPIcs.DISC.2017.27</a>
</li>
<li>
<span class="authors">Shady Issa, Pascal Felber, Alexander Matveev, and Paolo Romano</span>
<span class="title">Extending Hardware Transactional Memory Capacity via Rollback-Only Transactions and Suspend/Resume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.28">10.4230/LIPIcs.DISC.2017.28</a>
</li>
<li>
<span class="authors">Irvan Jahja, Haifeng Yu, and Yuda Zhao</span>
<span class="title">Some Lower Bounds in Dynamic Networks with Oblivious Adversaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.29">10.4230/LIPIcs.DISC.2017.29</a>
</li>
<li>
<span class="authors">Prasad Jayanti and Anup Joshi</span>
<span class="title">Recoverable FCFS Mutual Exclusion with Wait-Free Recovery</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.30">10.4230/LIPIcs.DISC.2017.30</a>
</li>
<li>
<span class="authors">Gillat Kol, Rotem Oshman, and Dafna Sadeh</span>
<span class="title">Interactive Compression for Multi-Party Protocol</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.31">10.4230/LIPIcs.DISC.2017.31</a>
</li>
<li>
<span class="authors">Christoph Lenzen and Joel Rybicki</span>
<span class="title">Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.32">10.4230/LIPIcs.DISC.2017.32</a>
</li>
<li>
<span class="authors">Nancy Lynch, Cameron Musco, and Merav Parter</span>
<span class="title">Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.33">10.4230/LIPIcs.DISC.2017.33</a>
</li>
<li>
<span class="authors">Varun Kanade, Frederik Mallmann-Trenn, and Victor Verdugo</span>
<span class="title">How Large Is Your Graph?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.34">10.4230/LIPIcs.DISC.2017.34</a>
</li>
<li>
<span class="authors">Hammurabi Mendes and Maurice Herlihy</span>
<span class="title">Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.35">10.4230/LIPIcs.DISC.2017.35</a>
</li>
<li>
<span class="authors">Ellis Michael, Dan R. K. Ports, Naveen Kr. Sharma, and Adriana Szekeres</span>
<span class="title">Recovering Shared Objects Without Stable Storage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.36">10.4230/LIPIcs.DISC.2017.36</a>
</li>
<li>
<span class="authors">Faisal Nawab, Joseph Izraelevitz, Terence Kelly, Charles B. Morrey III, Dhruva R. Chakrabarti, and Michael L. Scott</span>
<span class="title">Dalí: A Periodically Persistent Hash Map</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.37">10.4230/LIPIcs.DISC.2017.37</a>
</li>
<li>
<span class="authors">Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, and Peter Robinson</span>
<span class="title">Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.38">10.4230/LIPIcs.DISC.2017.38</a>
</li>
<li>
<span class="authors">Rafael Pass and Elaine Shi</span>
<span class="title">Hybrid Consensus: Efficient Consensus in the Permissionless Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.39">10.4230/LIPIcs.DISC.2017.39</a>
</li>
<li>
<span class="authors">Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi</span>
<span class="title">Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.40">10.4230/LIPIcs.DISC.2017.40</a>
</li>
<li>
<span class="authors">Ittai Abraham, Srinivas Devadas, Kartik Nayak, and Ling Ren</span>
<span class="title">Brief Announcement: Practical Synchronous Byzantine Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.41">10.4230/LIPIcs.DISC.2017.41</a>
</li>
<li>
<span class="authors">Yehuda Afek, Yuval Emek, and Noa Kolikant</span>
<span class="title">Brief Announcement: The Synergy of Finite State Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.42">10.4230/LIPIcs.DISC.2017.42</a>
</li>
<li>
<span class="authors">Lélia Blin and Sébastien Tixeuil</span>
<span class="title">Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.43">10.4230/LIPIcs.DISC.2017.43</a>
</li>
<li>
<span class="authors">Karl Bringmann and Sebastian Krinninger</span>
<span class="title">Brief Announcement: A Note on Hardness of Diameter Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.44">10.4230/LIPIcs.DISC.2017.44</a>
</li>
<li>
<span class="authors">Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, and Marcos K. Aguilera</span>
<span class="title">Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.45">10.4230/LIPIcs.DISC.2017.45</a>
</li>
<li>
<span class="authors">Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, and Pratik Sarkar</span>
<span class="title">Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.46">10.4230/LIPIcs.DISC.2017.46</a>
</li>
<li>
<span class="authors">Andrea Clementi, Luciano Gualà, Francesco Pasquale, and Giacomo Scornavacca</span>
<span class="title">Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.47">10.4230/LIPIcs.DISC.2017.47</a>
</li>
<li>
<span class="authors">Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Yukiko Yamauchi</span>
<span class="title">Brief Announcement: Shape Formation by Programmable Particles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.48">10.4230/LIPIcs.DISC.2017.48</a>
</li>
<li>
<span class="authors">Ryota Eguchi and Taisuke Izumi</span>
<span class="title">Brief Announcement: Fast Aggregation in Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.49">10.4230/LIPIcs.DISC.2017.49</a>
</li>
<li>
<span class="authors">Michal Friedman, Maurice Herlihy, Virendra Marathe, and Erez Petrank</span>
<span class="title">Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.50">10.4230/LIPIcs.DISC.2017.50</a>
</li>
<li>
<span class="authors">Matthias Függer, Thomas Nowak, and Manfred Schwarz</span>
<span class="title">Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.51">10.4230/LIPIcs.DISC.2017.51</a>
</li>
<li>
<span class="authors">Vijay K. Garg</span>
<span class="title">Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.52">10.4230/LIPIcs.DISC.2017.52</a>
</li>
<li>
<span class="authors">Rati Gelashvili, Idit Keidar, Alexander Spiegelman, and Roger Wattenhofer</span>
<span class="title">Brief Announcement: Towards Reduced Instruction Sets for Synchronization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.53">10.4230/LIPIcs.DISC.2017.53</a>
</li>
<li>
<span class="authors">Tomasz Jurdzínski and Krzysztof Nowicki</span>
<span class="title">Brief Announcement: On Connectivity in the Broadcast Congested Clique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.54">10.4230/LIPIcs.DISC.2017.54</a>
</li>
<li>
<span class="authors">Janne H. Korhonen and Jukka Suomela</span>
<span class="title">Brief Announcement: Towards a Complexity Theory for the Congested Clique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.55">10.4230/LIPIcs.DISC.2017.55</a>
</li>
<li>
<span class="authors">Petr Kuznetsov, Thibault Rieutord, and Yuan He</span>
<span class="title">Brief Announcement: Compact Topology of Shared-Memory Adversaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.56">10.4230/LIPIcs.DISC.2017.56</a>
</li>
<li>
<span class="authors">Christoph Lenzen and Reut Levi</span>
<span class="title">Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.57">10.4230/LIPIcs.DISC.2017.57</a>
</li>
<li>
<span class="authors">Bruna S. Peres, Olga Goussevskaia, Stefan Schmid, and Chen Avin</span>
<span class="title">Brief Announcement: Distributed SplayNets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.58">10.4230/LIPIcs.DISC.2017.58</a>
</li>
<li>
<span class="authors">Laurent Massoulié and Rémi Varloot</span>
<span class="title">Brief Announcement: Rapid Mixing of Local Dynamics on Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.DISC.2017.59">10.4230/LIPIcs.DISC.2017.59</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