<h2>LIPIcs, Volume 70, OPODIS 2016</h2>
<ul>
<li>
<span class="authors">Panagiota Fatourou, Ernesto Jiménez, and Fernando Pedone</span>
<span class="title">LIPIcs, Volume 70, OPODIS'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016">10.4230/LIPIcs.OPODIS.2016</a>
</li>
<li>
<span class="authors">Panagiota Fatourou, Ernesto Jiménez, and Fernando Pedone</span>
<span class="title">Front Matter, Table of Contents, Preface, Committees, List of Authors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.0">10.4230/LIPIcs.OPODIS.2016.0</a>
</li>
<li>
<span class="authors">Nir Shavit</span>
<span class="title">High Throughput Connectomics (Keynote Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.1">10.4230/LIPIcs.OPODIS.2016.1</a>
</li>
<li>
<span class="authors">Christian Cachin</span>
<span class="title">Blockchain - From the Anarchy of Cryptocurrencies to the Enterprise (Keynote Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.2">10.4230/LIPIcs.OPODIS.2016.2</a>
</li>
<li>
<span class="authors">Willy Zwaenepoel</span>
<span class="title">Really Big Data: Analytics on Graphs with Trillions of Edges (Keynote Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.3">10.4230/LIPIcs.OPODIS.2016.3</a>
</li>
<li>
<span class="authors">Faith Ellen</span>
<span class="title">Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.4">10.4230/LIPIcs.OPODIS.2016.4</a>
</li>
<li>
<span class="authors">David Yu Cheng Chan, Vassos Hadzilacos, and Sam Toueg</span>
<span class="title">Bounded Disagreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.5">10.4230/LIPIcs.OPODIS.2016.5</a>
</li>
<li>
<span class="authors">Eli Gafni, Yuan He, Petr Kuznetsov, and Thibault Rieutord</span>
<span class="title">Read-Write Memory and k-Set Consensus as an Affine Task</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.6">10.4230/LIPIcs.OPODIS.2016.6</a>
</li>
<li>
<span class="authors">Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, and Petr Kuznetsov</span>
<span class="title">Set-Consensus Collections are Decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.7">10.4230/LIPIcs.OPODIS.2016.7</a>
</li>
<li>
<span class="authors">Emmanuel Godard and Eloi Perdereau</span>
<span class="title">k-Set Agreement in Communication Networks with Omission Faults</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.8">10.4230/LIPIcs.OPODIS.2016.8</a>
</li>
<li>
<span class="authors">Sriram Pemmaraju and Talal Riaz</span>
<span class="title">Using Read-k Inequalities to Analyze a Distributed MIS Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.9">10.4230/LIPIcs.OPODIS.2016.9</a>
</li>
<li>
<span class="authors">Stéphane Devismes, David Ilcinkas, and Colette Johnen</span>
<span class="title">Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.10">10.4230/LIPIcs.OPODIS.2016.10</a>
</li>
<li>
<span class="authors">Johanne Cohen, Khaled Maâmra, George Manoussakis, and Laurence Pilard</span>
<span class="title">Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.11">10.4230/LIPIcs.OPODIS.2016.11</a>
</li>
<li>
<span class="authors">Pankaj Khanchandani and Roger Wattenhofer</span>
<span class="title">Distributed Stable Matching with Similar Preference Lists</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.12">10.4230/LIPIcs.OPODIS.2016.12</a>
</li>
<li>
<span class="authors">James Aspnes, Joffroy Beauquier, Janna Burman, and Devan Sohier</span>
<span class="title">Time and Space Optimal Counting in Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.13">10.4230/LIPIcs.OPODIS.2016.13</a>
</li>
<li>
<span class="authors">Leszek Gasieniec, David Hamilton, Russell Martin, Paul G. Spirakis, and Grzegorz Stachowiak</span>
<span class="title">Deterministic Population Protocols for Exact Majority and Plurality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.14">10.4230/LIPIcs.OPODIS.2016.14</a>
</li>
<li>
<span class="authors">Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari</span>
<span class="title">Design Patterns in Beeping Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.15">10.4230/LIPIcs.OPODIS.2016.15</a>
</li>
<li>
<span class="authors">Rachid Guerraoui and Alexandre Maurer</span>
<span class="title">Collision-Free Pattern Formation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.16">10.4230/LIPIcs.OPODIS.2016.16</a>
</li>
<li>
<span class="authors">Yen-Jung Chang and Vijay K. Garg</span>
<span class="title">Predicate Detection for Parallel Computations with Locking Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.17">10.4230/LIPIcs.OPODIS.2016.17</a>
</li>
<li>
<span class="authors">Kim G. Larsen, Stefan Schmid, and Bingtian Xue</span>
<span class="title">WNetKAT: A Weighted SDN Programming and Verification Language</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.18">10.4230/LIPIcs.OPODIS.2016.18</a>
</li>
<li>
<span class="authors">Mozhgan Ghasemzadeh, Hamid Arabnejad, and Jorge G. Barbosa</span>
<span class="title">Deadline-Budget constrained Scheduling Algorithm for Scientific Workflows in a Cloud Environment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.19">10.4230/LIPIcs.OPODIS.2016.19</a>
</li>
<li>
<span class="authors">Stavros Nikolaou and Robbert van Renesse</span>
<span class="title">Moving Participants Turtle Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.20">10.4230/LIPIcs.OPODIS.2016.20</a>
</li>
<li>
<span class="authors">Fabien Mathieu</span>
<span class="title">Kleinberg’s Grid Reloaded</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.21">10.4230/LIPIcs.OPODIS.2016.21</a>
</li>
<li>
<span class="authors">Annalisa De Bonis</span>
<span class="title">Generalized Selectors and Locally Thin Families with Applications to Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.22">10.4230/LIPIcs.OPODIS.2016.22</a>
</li>
<li>
<span class="authors">Aras Atalar, Paul Renaud-Goud, and Philippas Tsigas</span>
<span class="title">How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.23">10.4230/LIPIcs.OPODIS.2016.23</a>
</li>
<li>
<span class="authors">Christian Cachin, Simon Schubert, and Marko Vukolic</span>
<span class="title">Non-Determinism in Byzantine Fault-Tolerant Replication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.24">10.4230/LIPIcs.OPODIS.2016.24</a>
</li>
<li>
<span class="authors">Heidi Howard, Dahlia Malkhi, and Alexander Spiegelman</span>
<span class="title">Flexible Paxos: Quorum Intersection Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.25">10.4230/LIPIcs.OPODIS.2016.25</a>
</li>
<li>
<span class="authors">Zhuolun Xiang and Nitin H. Vaidya</span>
<span class="title">Relaxed Byzantine Vector Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.26">10.4230/LIPIcs.OPODIS.2016.26</a>
</li>
<li>
<span class="authors">Ammar Qadri</span>
<span class="title">m-Consensus Objects Are Pretty Powerful</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.27">10.4230/LIPIcs.OPODIS.2016.27</a>
</li>
<li>
<span class="authors">Kishori M. Konwar, N. Prakash, Nancy A. Lynch, and Muriel Médard</span>
<span class="title">RADON: Repairable Atomic Data Object in Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.28">10.4230/LIPIcs.OPODIS.2016.28</a>
</li>
<li>
<span class="authors">Antonio Fernández Anta, Theophanis Hadjistasi, and Nicolas Nicolaou</span>
<span class="title">Computationally Light "Multi-Speed" Atomic Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.29">10.4230/LIPIcs.OPODIS.2016.29</a>
</li>
<li>
<span class="authors">Tiago Oliveira, Ricardo Mendes, and Alysson Bessani</span>
<span class="title">Exploring Key-Value Stores in Multi-Writer Byzantine-Resilient Register Emulations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.30">10.4230/LIPIcs.OPODIS.2016.30</a>
</li>
<li>
<span class="authors">Leander Jehl and Hein Meling</span>
<span class="title">The Case for Reconfiguration without Consensus: Comparing Algorithms for Atomic Storage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.31">10.4230/LIPIcs.OPODIS.2016.31</a>
</li>
<li>
<span class="authors">Tian Ze Chen and Yuanhao Wei</span>
<span class="title">Step Optimal Implementations of Large Single-Writer Registers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.32">10.4230/LIPIcs.OPODIS.2016.32</a>
</li>
<li>
<span class="authors">Alexander Spiegelman and Idit Keidar</span>
<span class="title">Dynamic Atomic Snapshots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.33">10.4230/LIPIcs.OPODIS.2016.33</a>
</li>
<li>
<span class="authors">Meng He and Mengdu Li</span>
<span class="title">Deletion without Rebalancing in Non-Blocking Binary Search Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.34">10.4230/LIPIcs.OPODIS.2016.34</a>
</li>
<li>
<span class="authors">Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim</span>
<span class="title">Proving Opacity of a Pessimistic STM</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2016.35">10.4230/LIPIcs.OPODIS.2016.35</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