<h2>LIPIcs, Volume 95, OPODIS 2017</h2>
<ul>
<li>
<span class="authors">James Aspnes, Alysson Bessani, Pascal Felber, and João Leitão</span>
<span class="title">LIPIcs, Volume 95, OPODIS'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017">10.4230/LIPIcs.OPODIS.2017</a>
</li>
<li>
<span class="authors">James Aspnes, Alysson Bessani, Pascal Felber, and João Leitão</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.0">10.4230/LIPIcs.OPODIS.2017.0</a>
</li>
<li>
<span class="authors">Luís Rodrigues</span>
<span class="title">Causality for the Masses: Offering Fresh Data, Low Latency, and High Throughput</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.1">10.4230/LIPIcs.OPODIS.2017.1</a>
</li>
<li>
<span class="authors">Conrad Burchert and Roger Wattenhofer</span>
<span class="title">piChain: When a Blockchain meets Paxos</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.2">10.4230/LIPIcs.OPODIS.2017.2</a>
</li>
<li>
<span class="authors">Fabian Kuhn and Philipp Schneider</span>
<span class="title">Broadcasting in an Unreliable SINR Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.3">10.4230/LIPIcs.OPODIS.2017.3</a>
</li>
<li>
<span class="authors">Janne H. Korhonen and Joel Rybicki</span>
<span class="title">Deterministic Subgraph Detection in Broadcast CONGEST</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.4">10.4230/LIPIcs.OPODIS.2017.4</a>
</li>
<li>
<span class="authors">Michael Dinitz and Yasamin Nazari</span>
<span class="title">Distributed Distance-Bounded Network Design Through Distributed Convex Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.5">10.4230/LIPIcs.OPODIS.2017.5</a>
</li>
<li>
<span class="authors">Tzlil Gonen and Rotem Oshman</span>
<span class="title">Lower Bounds for Subgraph Detection in the CONGEST Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.6">10.4230/LIPIcs.OPODIS.2017.6</a>
</li>
<li>
<span class="authors">Tingzhe Zhou, Victor Luchangco, and Michael Spear</span>
<span class="title">Extending Transactional Memory with Atomic Deferral</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.7">10.4230/LIPIcs.OPODIS.2017.7</a>
</li>
<li>
<span class="authors">Panagiota Fatourou and Nikolaos D. Kallimanis</span>
<span class="title">Lock Oscillation: Boosting the Performance of Concurrent Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.8">10.4230/LIPIcs.OPODIS.2017.8</a>
</li>
<li>
<span class="authors">Damien Imbs, Petr Kuznetsov, and Thibault Rieutord</span>
<span class="title">Progress-Space Tradeoffs in Single-Writer Memory Implementations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.9">10.4230/LIPIcs.OPODIS.2017.9</a>
</li>
<li>
<span class="authors">Nachshon Cohen, Maurice Herlihy, Erez Petrank, and Elias Wald</span>
<span class="title">The Teleportation Design Pattern for Hardware Transactional Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.10">10.4230/LIPIcs.OPODIS.2017.10</a>
</li>
<li>
<span class="authors">Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, and Jaroslav Opatrny</span>
<span class="title">Evacuating an Equilateral Triangle in the Face-to-Face Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.11">10.4230/LIPIcs.OPODIS.2017.11</a>
</li>
<li>
<span class="authors">Ha Thi Thu Doan, François Bonnet, and Kazuhiro Ogata</span>
<span class="title">Model Checking of Robot Gathering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.12">10.4230/LIPIcs.OPODIS.2017.12</a>
</li>
<li>
<span class="authors">Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita</span>
<span class="title">Plane Formation by Synchronous Mobile Robots without Chirality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.13">10.4230/LIPIcs.OPODIS.2017.13</a>
</li>
<li>
<span class="authors">Stefan Dobrev, Rastislav Královic, and Dana Pardubská</span>
<span class="title">Treasure Hunt with Barely Communicating Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.14">10.4230/LIPIcs.OPODIS.2017.14</a>
</li>
<li>
<span class="authors">Bogdan S. Chlebus, Gianluca De Marco, and Muhammed Talo</span>
<span class="title">Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.15">10.4230/LIPIcs.OPODIS.2017.15</a>
</li>
<li>
<span class="authors">Hagit Attiya and Arie Fouren</span>
<span class="title">Lower Bounds on the Amortized Time Complexity of Shared Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.16">10.4230/LIPIcs.OPODIS.2017.16</a>
</li>
<li>
<span class="authors">Rotem Dvir and Gadi Taubenfeld</span>
<span class="title">Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.17">10.4230/LIPIcs.OPODIS.2017.17</a>
</li>
<li>
<span class="authors">Hagit Attiya and Gili Yavneh</span>
<span class="title">Remote Memory References at Block Granularity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.18">10.4230/LIPIcs.OPODIS.2017.18</a>
</li>
<li>
<span class="authors">Hiroto Yasumi, Fukuhito Ooshita, Ken'ichi Yamaguchi, and Michiko Inoue</span>
<span class="title">Constant-Space Population Protocols for Uniform Bipartition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.19">10.4230/LIPIcs.OPODIS.2017.19</a>
</li>
<li>
<span class="authors">Himanshu Chauhan and Vijay K. Garg</span>
<span class="title">Fast Detection of Stable and Count Predicates in Parallel Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.20">10.4230/LIPIcs.OPODIS.2017.20</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel and Michal Dory</span>
<span class="title">Fast Distributed Approximation for TAP and 2-Edge-Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.21">10.4230/LIPIcs.OPODIS.2017.21</a>
</li>
<li>
<span class="authors">Susumu Nishimura</span>
<span class="title">Schlegel Diagram and Optimizable Immediate Snapshot Protocol</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.22">10.4230/LIPIcs.OPODIS.2017.22</a>
</li>
<li>
<span class="authors">Tim Jungnickel, Lennart Oldenburg, and Matthias Loibl</span>
<span class="title">Designing a Planetary-Scale IMAP Service with Conflict-free Replicated Data Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.23">10.4230/LIPIcs.OPODIS.2017.23</a>
</li>
<li>
<span class="authors">Gonçalo Cabrita and Nuno Preguiça</span>
<span class="title">Non-Uniform Replication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.24">10.4230/LIPIcs.OPODIS.2017.24</a>
</li>
<li>
<span class="authors">Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Alexander Spiegelman</span>
<span class="title">Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.25">10.4230/LIPIcs.OPODIS.2017.25</a>
</li>
<li>
<span class="authors">Eduardo Alchieri, Alysson Bessani, Fabíola Greve, and Joni da Silva Fraga</span>
<span class="title">Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant Storage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.26">10.4230/LIPIcs.OPODIS.2017.26</a>
</li>
<li>
<span class="authors">Roy Friedman and Roni Licher</span>
<span class="title">Hardening Cassandra Against Byzantine Failures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.27">10.4230/LIPIcs.OPODIS.2017.27</a>
</li>
<li>
<span class="authors">André Joaquim, Miguel L. Pardal, and Miguel Correia</span>
<span class="title">Vulnerability-Tolerant Transport Layer Security</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.28">10.4230/LIPIcs.OPODIS.2017.28</a>
</li>
<li>
<span class="authors">Adam Shimi, Aurélie Hurault, and Philippe Quéinnec</span>
<span class="title">Asynchronous Message Orderings Beyond Causality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.29">10.4230/LIPIcs.OPODIS.2017.29</a>
</li>
<li>
<span class="authors">Tuomo Lempiäinen and Jukka Suomela</span>
<span class="title">Constant Space and Non-Constant Time in Distributed Computing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.30">10.4230/LIPIcs.OPODIS.2017.30</a>
</li>
<li>
<span class="authors">Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Yukiko Yamauchi</span>
<span class="title">Shape Formation by Programmable Particles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.31">10.4230/LIPIcs.OPODIS.2017.31</a>
</li>
<li>
<span class="authors">Marijana Lazic, Igor Konnov, Josef Widder, and Roderick Bloem</span>
<span class="title">Synthesis of Distributed Algorithms with Parameterized Threshold Guards</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2017.32">10.4230/LIPIcs.OPODIS.2017.32</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