<h2>LIPIcs, Volume 46, OPODIS 2015</h2>
<ul>
<li>
<span class="authors">Emmanuelle Anceaume, Christian Cachin, and Maria Potop-Butucaru</span>
<span class="title">LIPIcs, Volume 46, OPODIS'15, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015">10.4230/LIPIcs.OPODIS.2015</a>
</li>
<li>
<span class="authors">Emmanuelle Anceaume, Christian Cachin, and Maria Potop-Butucaru</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.2015.0">10.4230/LIPIcs.OPODIS.2015.0</a>
</li>
<li>
<span class="authors">Michel Raynal</span>
<span class="title">Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.1">10.4230/LIPIcs.OPODIS.2015.1</a>
</li>
<li>
<span class="authors">Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi</span>
<span class="title">Dynamic Reconfiguration: A Tutorial (Tutorial)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.2">10.4230/LIPIcs.OPODIS.2015.2</a>
</li>
<li>
<span class="authors">Nicola Santoro</span>
<span class="title">Time to Change: On Distributed Computing in Dynamic Networks (Keynote)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.3">10.4230/LIPIcs.OPODIS.2015.3</a>
</li>
<li>
<span class="authors">Alexander Spiegelman, Yuval Cassuto, Gregory Chockler, and Idit Keidar</span>
<span class="title">Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.4">10.4230/LIPIcs.OPODIS.2015.4</a>
</li>
<li>
<span class="authors">Juan A. Garay</span>
<span class="title">Blockchain-Based Consensus (Keynote)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.5">10.4230/LIPIcs.OPODIS.2015.5</a>
</li>
<li>
<span class="authors">Stephan Holzer and Nathan Pinsker</span>
<span class="title">Approximation of Distances and Shortest Paths in the Broadcast Congest Clique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.6">10.4230/LIPIcs.OPODIS.2015.6</a>
</li>
<li>
<span class="authors">Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, and Anisur Rahaman Molla</span>
<span class="title">The Cost of Global Broadcast in Dynamic Radio Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.7">10.4230/LIPIcs.OPODIS.2015.7</a>
</li>
<li>
<span class="authors">Seth Gilbert, Calvin Newport, and Tonghe Wang</span>
<span class="title">Bounds for Blind Rate Adaptation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.8">10.4230/LIPIcs.OPODIS.2015.8</a>
</li>
<li>
<span class="authors">Tobias Langner, Barbara Keller, Jara Uitto, and Roger Wattenhofer</span>
<span class="title">Overcoming Obstacles with Ants</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.9">10.4230/LIPIcs.OPODIS.2015.9</a>
</li>
<li>
<span class="authors">Fabian Kuhn and Anisur Rahaman Molla</span>
<span class="title">Distributed Sparse Cut Approximation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.10">10.4230/LIPIcs.OPODIS.2015.10</a>
</li>
<li>
<span class="authors">Magnús M. Halldórsson, Sven Köhler, and Dror Rawitz</span>
<span class="title">Distributed Approximation of k-Service Assignment</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.11">10.4230/LIPIcs.OPODIS.2015.11</a>
</li>
<li>
<span class="authors">Claire Capdevielle, Colette Johnen, Petr Kuznetsov, and Alessia Milani</span>
<span class="title">On the Uncontended Complexity of Anonymous Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.12">10.4230/LIPIcs.OPODIS.2015.12</a>
</li>
<li>
<span class="authors">Vikram Saraph and Maurice Herlihy</span>
<span class="title">The Relative Power of Composite Loop Agreement Tasks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.13">10.4230/LIPIcs.OPODIS.2015.13</a>
</li>
<li>
<span class="authors">Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa</span>
<span class="title">Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.14">10.4230/LIPIcs.OPODIS.2015.14</a>
</li>
<li>
<span class="authors">Orr Tamir, Adam Morrison, and Noam Rinetzky</span>
<span class="title">A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.15">10.4230/LIPIcs.OPODIS.2015.15</a>
</li>
<li>
<span class="authors">Ajoy K. Datta, Lawrence L. Larmore, and Toshimitsu Masuzawa</span>
<span class="title">Maximum Matching for Anonymous Trees with Constant Space per Process</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.16">10.4230/LIPIcs.OPODIS.2015.16</a>
</li>
<li>
<span class="authors">Leqi Zhu and Faith Ellen</span>
<span class="title">Atomic Snapshots from Small Registers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.17">10.4230/LIPIcs.OPODIS.2015.17</a>
</li>
<li>
<span class="authors">Zohir Bouzid, Michel Raynal, and Pierre Sutra</span>
<span class="title">Anonymous Obstruction-Free (n,k)-Set Agreement with n-k+1 Atomic Read/Write Registers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.18">10.4230/LIPIcs.OPODIS.2015.18</a>
</li>
<li>
<span class="authors">Antonio Fernández Anta, Nicolas Nicolaou, and Alexandru Popa</span>
<span class="title">Making "Fast" Atomic Operations Computationally Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.19">10.4230/LIPIcs.OPODIS.2015.19</a>
</li>
<li>
<span class="authors">Ryan Berryhill, Wojciech Golab, and Mahesh Tripunitara</span>
<span class="title">Robust Shared Objects for Non-Volatile Main Memory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.20">10.4230/LIPIcs.OPODIS.2015.20</a>
</li>
<li>
<span class="authors">Joffroy Beauquier, Peva Blanchard, Janna Burman, and Rachid Guerraoui</span>
<span class="title">The Benefits of Entropy in Population Protocols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.21">10.4230/LIPIcs.OPODIS.2015.21</a>
</li>
<li>
<span class="authors">David Stolz and Roger Wattenhofer</span>
<span class="title">Byzantine Agreement with Median Validity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.22">10.4230/LIPIcs.OPODIS.2015.22</a>
</li>
<li>
<span class="authors">Jingshu Chen, Mohammad Roohitavaf, and Sandeep S. Kulkarni</span>
<span class="title">Ensuring Average Recovery with Adversarial Scheduler</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.23">10.4230/LIPIcs.OPODIS.2015.23</a>
</li>
<li>
<span class="authors">Christian Scheideler, Alexander Setzer, and Thim Strothmann</span>
<span class="title">Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">10.4230/LIPIcs.OPODIS.2015.24</a>
</li>
<li>
<span class="authors">Yen-Jung Chang and Vijay K. Garg</span>
<span class="title">QuickLex: A Fast Algorithm for Consistent Global States Enumeration of Distributed Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.25">10.4230/LIPIcs.OPODIS.2015.25</a>
</li>
<li>
<span class="authors">Damien Imbs</span>
<span class="title">The Synchronization Power of Atomic Bitwise Operations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.26">10.4230/LIPIcs.OPODIS.2015.26</a>
</li>
<li>
<span class="authors">Nikolaos D. Kallimanis and Eleni Kanellou</span>
<span class="title">Wait-Free Concurrent Graph Objects with Dynamic Traversals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.27">10.4230/LIPIcs.OPODIS.2015.27</a>
</li>
<li>
<span class="authors">Alessia Milani and Miguel A. Mosteiro</span>
<span class="title">A Faster Counting Protocol for Anonymous Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.28">10.4230/LIPIcs.OPODIS.2015.28</a>
</li>
<li>
<span class="authors">Wei-Lun Hung, Himanshu Chauhan, and Vijay K. Garg</span>
<span class="title">ActiveMonitor: Asynchronous Monitor Framework for Scalability and Multi-Object Synchronization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.29">10.4230/LIPIcs.OPODIS.2015.29</a>
</li>
<li>
<span class="authors">Artur Czumaj and Peter Davies</span>
<span class="title">Communicating with Beeps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.30">10.4230/LIPIcs.OPODIS.2015.30</a>
</li>
<li>
<span class="authors">Hagit Attiya, Armando Castaneda, and Danny Hendler</span>
<span class="title">Nontrivial and Universal Helping for Wait-Free Queues and Stacks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.31">10.4230/LIPIcs.OPODIS.2015.31</a>
</li>
<li>
<span class="authors">Edward Talmage and Jennifer Welch</span>
<span class="title">Generic Proofs of Consensus Numbers for Abstract Data Types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.32">10.4230/LIPIcs.OPODIS.2015.32</a>
</li>
<li>
<span class="authors">Giuseppe Di Luna and Roberto Baldoni</span>
<span class="title">Non Trivial Computations in Anonymous Dynamic Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.33">10.4230/LIPIcs.OPODIS.2015.33</a>
</li>
<li>
<span class="authors">Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, and Murat Demirbas</span>
<span class="title">Analysis of Bounds on Hybrid Vector Clocks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.34">10.4230/LIPIcs.OPODIS.2015.34</a>
</li>
<li>
<span class="authors">Niloufar Shafiei</span>
<span class="title">Non-Blocking Doubly-Linked Lists with Good Amortized Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.35">10.4230/LIPIcs.OPODIS.2015.35</a>
</li>
<li>
<span class="authors">Hagit Attiya and Arie Fouren</span>
<span class="title">Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.36">10.4230/LIPIcs.OPODIS.2015.36</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