<h2>LIPIcs, Volume 125, OPODIS 2018</h2>
<ul>
<li>
<span class="authors">Jiannong Cao, Faith Ellen, Luis Rodrigues, and Bernardo Ferreira</span>
<span class="title">LIPIcs, Volume 125, OPODIS'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018">10.4230/LIPIcs.OPODIS.2018</a>
</li>
<li>
<span class="authors">Jiannong Cao, Faith Ellen, Luis Rodrigues, and Bernardo Ferreira</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.0">10.4230/LIPIcs.OPODIS.2018.0</a>
</li>
<li>
<span class="authors">Jennifer L. Welch</span>
<span class="title">Complexity of Multi-Valued Register Simulations: A Retrospective (Keynote)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.1">10.4230/LIPIcs.OPODIS.2018.1</a>
</li>
<li>
<span class="authors">Amr El Abbadi</span>
<span class="title">Distributed Systems and Databases of the Globe Unite! The Cloud, the Edge and Blockchains (Keynote)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.2">10.4230/LIPIcs.OPODIS.2018.2</a>
</li>
<li>
<span class="authors">Siddhartha Sen</span>
<span class="title">How to Make Decisions (Optimally) (Keynote)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.3">10.4230/LIPIcs.OPODIS.2018.3</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Dean Leitersdorf, and Elia Turner</span>
<span class="title">Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.4">10.4230/LIPIcs.OPODIS.2018.4</a>
</li>
<li>
<span class="authors">Tanmay Inamdar, Shreyas Pai, and Sriram V. Pemmaraju</span>
<span class="title">Large-Scale Distributed Algorithms for Facility Location with Outliers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.5">10.4230/LIPIcs.OPODIS.2018.5</a>
</li>
<li>
<span class="authors">Simon Collet, Pierre Fraigniaud, and Paolo Penna</span>
<span class="title">Equilibria of Games in Networks for Local Tasks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.6">10.4230/LIPIcs.OPODIS.2018.6</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel, Ami Paz, and Noam Ravid</span>
<span class="title">The Sparsest Additive Spanner via Multiple Weighted BFS Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.7">10.4230/LIPIcs.OPODIS.2018.7</a>
</li>
<li>
<span class="authors">Jeremy Ko</span>
<span class="title">The Amortized Analysis of a Non-blocking Chromatic Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.8">10.4230/LIPIcs.OPODIS.2018.8</a>
</li>
<li>
<span class="authors">Aras Atalar, Paul Renaud-Goud, and Philippas Tsigas</span>
<span class="title">Lock-Free Search Data Structures: Throughput Modeling with Poisson Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.9">10.4230/LIPIcs.OPODIS.2018.9</a>
</li>
<li>
<span class="authors">Robert Kelly, Barak A. Pearlmutter, and Phil Maguire</span>
<span class="title">Concurrent Robin Hood Hashing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.10">10.4230/LIPIcs.OPODIS.2018.10</a>
</li>
<li>
<span class="authors">Vitaly Aksenov, Petr Kuznetsov, and Anatoly Shalyto</span>
<span class="title">Parallel Combining: Benefits of Explicit Synchronization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.11">10.4230/LIPIcs.OPODIS.2018.11</a>
</li>
<li>
<span class="authors">Hengfeng Wei, Yu Huang, and Jian Lu</span>
<span class="title">Specification and Implementation of Replicated List: The Jupiter Protocol Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.12">10.4230/LIPIcs.OPODIS.2018.12</a>
</li>
<li>
<span class="authors">Klaus-Tycho Foerster, Mahmoud Parham, Stefan Schmid, and Tao Wen</span>
<span class="title">Local Fast Segment Rerouting on Hypercubes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.13">10.4230/LIPIcs.OPODIS.2018.13</a>
</li>
<li>
<span class="authors">Dimitris Sakavalas, Lewis Tseng, and Nitin H. Vaidya</span>
<span class="title">Effects of Topology Knowledge and Relay Depth on Asynchronous Appoximate Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.14">10.4230/LIPIcs.OPODIS.2018.14</a>
</li>
<li>
<span class="authors">Wenbo Xu, Signe Rüsch, Bijun Li, and Rüdiger Kapitza</span>
<span class="title">Hybrid Fault-Tolerant Consensus in Asynchronous and Wireless Embedded Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.15">10.4230/LIPIcs.OPODIS.2018.15</a>
</li>
<li>
<span class="authors">Yackolley Amoussou-Guenou, Antonella Del Pozzo, Maria Potop-Butucaru, and Sara Tucci-Piergiovanni</span>
<span class="title">Correctness of Tendermint-Core Blockchains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.16">10.4230/LIPIcs.OPODIS.2018.16</a>
</li>
<li>
<span class="authors">Álvaro García-Pérez and Alexey Gotsman</span>
<span class="title">Federated Byzantine Quorum Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.17">10.4230/LIPIcs.OPODIS.2018.17</a>
</li>
<li>
<span class="authors">Adam Shimi, Aurélie Hurault, and Philippe Quéinnec</span>
<span class="title">Characterizing Asynchronous Message-Passing Models Through Rounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.18">10.4230/LIPIcs.OPODIS.2018.18</a>
</li>
<li>
<span class="authors">David Kozhaya, Ognjen Maric, and Yvonne-Anne Pignolet</span>
<span class="title">You Only Live Multiple Times: A Blackbox Solution for Reusing Crash-Stop Algorithms In Realistic Crash-Recovery Settings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.19">10.4230/LIPIcs.OPODIS.2018.19</a>
</li>
<li>
<span class="authors">Brice Nédelec, Pascal Molli, and Achour Mostéfaoui</span>
<span class="title">Causal Broadcast: How to Forget?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.20">10.4230/LIPIcs.OPODIS.2018.20</a>
</li>
<li>
<span class="authors">Ben Chugg, Hooman Hashemi, and Anne Condon</span>
<span class="title">Output-Oblivious Stochastic Chemical Reaction Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.21">10.4230/LIPIcs.OPODIS.2018.21</a>
</li>
<li>
<span class="authors">Yehuda Afek, Yuval Emek, and Noa Kolikant</span>
<span class="title">The Synergy of Finite State Machines</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.22">10.4230/LIPIcs.OPODIS.2018.22</a>
</li>
<li>
<span class="authors">Petr Kuznetsov and Nayuta Yanagisawa</span>
<span class="title">Task Computability in Unreliable Anonymous Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.23">10.4230/LIPIcs.OPODIS.2018.23</a>
</li>
<li>
<span class="authors">Takashi Okumura, Koichi Wada, and Xavier Défago</span>
<span class="title">Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.24">10.4230/LIPIcs.OPODIS.2018.24</a>
</li>
<li>
<span class="authors">Jurek Czyzowicz, Ryan Killick, and Evangelos Kranakis</span>
<span class="title">Linear Rendezvous with Asymmetric Clocks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.25">10.4230/LIPIcs.OPODIS.2018.25</a>
</li>
<li>
<span class="authors">Calvin Newport and Chaodong Zheng</span>
<span class="title">Approximate Neighbor Counting in Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.26">10.4230/LIPIcs.OPODIS.2018.26</a>
</li>
<li>
<span class="authors">Seth Gilbert, Nancy Lynch, Calvin Newport, and Dominik Pajak</span>
<span class="title">On Simple Back-Off in Unreliable Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.27">10.4230/LIPIcs.OPODIS.2018.27</a>
</li>
<li>
<span class="authors">Éric Goubault, Jérémy Ledent, and Samuel Mimram</span>
<span class="title">Concurrent Specifications Beyond Linearizability</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.28">10.4230/LIPIcs.OPODIS.2018.28</a>
</li>
<li>
<span class="authors">Nahal Mirzaie, Fathiyeh Faghih, Swen Jacobs, and Borzoo Bonakdarpour</span>
<span class="title">Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.29">10.4230/LIPIcs.OPODIS.2018.29</a>
</li>
<li>
<span class="authors">Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta, and Lawrence L. Larmore</span>
<span class="title">Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.30">10.4230/LIPIcs.OPODIS.2018.30</a>
</li>
<li>
<span class="authors">Yuichi Sudo, Ajoy K. Datta, Lawrence L. Larmore, and Toshimitsu Masuzawa</span>
<span class="title">Self-Stabilizing Token Distribution with Constant-Space for Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2018.31">10.4230/LIPIcs.OPODIS.2018.31</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