<h2>LIPIcs, Volume 153, OPODIS 2019</h2>
<ul>
<li>
<span class="authors">Pascal Felber, Roy Friedman, Seth Gilbert, and Avery Miller</span>
<span class="title">LIPIcs, Vol. 153, OPODIS 2019, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019">10.4230/LIPIcs.OPODIS.2019</a>
</li>
<li>
<span class="authors">Pascal Felber, Roy Friedman, Seth Gilbert, and Avery Miller</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.0">10.4230/LIPIcs.OPODIS.2019.0</a>
</li>
<li>
<span class="authors">Rachid Guerraoui</span>
<span class="title">Demystifying Bitcoin (Keynote Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.1">10.4230/LIPIcs.OPODIS.2019.1</a>
</li>
<li>
<span class="authors">Keren Censor-Hillel</span>
<span class="title">Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.2">10.4230/LIPIcs.OPODIS.2019.2</a>
</li>
<li>
<span class="authors">Haris Pozidis</span>
<span class="title">Snap ML - Accelerated Machine Learning for Big Data (Keynote Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.3">10.4230/LIPIcs.OPODIS.2019.3</a>
</li>
<li>
<span class="authors">Kfir Lev-Ari, Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi</span>
<span class="title">FairLedger: A Fair Blockchain Protocol for Financial Institutions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.4">10.4230/LIPIcs.OPODIS.2019.4</a>
</li>
<li>
<span class="authors">Álvaro García-Pérez and Maria A. Schett</span>
<span class="title">Deconstructing Stellar Consensus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.5">10.4230/LIPIcs.OPODIS.2019.5</a>
</li>
<li>
<span class="authors">Alex Auvolat, Michel Raynal, and François Taïani</span>
<span class="title">Byzantine-Tolerant Set-Constrained Delivery Broadcast</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.6">10.4230/LIPIcs.OPODIS.2019.6</a>
</li>
<li>
<span class="authors">Christian Cachin and Björn Tackmann</span>
<span class="title">Asymmetric Distributed Trust</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.7">10.4230/LIPIcs.OPODIS.2019.7</a>
</li>
<li>
<span class="authors">Hiroto Yasumi, Fukuhito Ooshita, and Michiko Inoue</span>
<span class="title">Uniform Partition in Population Protocol Model Under Weak Fairness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.8">10.4230/LIPIcs.OPODIS.2019.8</a>
</li>
<li>
<span class="authors">Genc Tato, Marin Bertier, Etienne Rivière, and Cédric Tedeschi</span>
<span class="title">Split and Migrate: Resource-Driven Placement and Discovery of Microservices at the Edge</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.9">10.4230/LIPIcs.OPODIS.2019.9</a>
</li>
<li>
<span class="authors">Zhanhao Chen, Ahmed Hassan, Masoomeh Javidi Kishi, Jacob Nelson, and Roberto Palmieri</span>
<span class="title">HaTS: Hardware-Assisted Transaction Scheduler</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.10">10.4230/LIPIcs.OPODIS.2019.10</a>
</li>
<li>
<span class="authors">Nuno Machado, Francisco Maia, Francisco Neves, Fábio Coelho, and José Pereira</span>
<span class="title">Minha: Large-Scale Distributed Systems Testing Made Practical</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.11">10.4230/LIPIcs.OPODIS.2019.11</a>
</li>
<li>
<span class="authors">Kishori M. Konwar, N. Prakash, Muriel Médard, and Nancy Lynch</span>
<span class="title">Fast Lean Erasure-Coded Atomic Memory Object</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.12">10.4230/LIPIcs.OPODIS.2019.12</a>
</li>
<li>
<span class="authors">Ran Gelles and Siddharth Iyer</span>
<span class="title">Interactive Coding Resilient to an Unknown Number of Erasures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.13">10.4230/LIPIcs.OPODIS.2019.13</a>
</li>
<li>
<span class="authors">Weihai Yu, Victorien Elvinger, and Claudia-Lavinia Ignat</span>
<span class="title">A Generic Undo Support for State-Based CRDTs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.14">10.4230/LIPIcs.OPODIS.2019.14</a>
</li>
<li>
<span class="authors">Dan Alistarh, Alexander Fedorov, and Nikita Koval</span>
<span class="title">In Search of the Fastest Concurrent Union-Find Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.15">10.4230/LIPIcs.OPODIS.2019.15</a>
</li>
<li>
<span class="authors">Felipe de Azevedo Piovezan, Vassos Hadzilacos, and Sam Toueg</span>
<span class="title">On Deterministic Linearizable Set Agreement Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.16">10.4230/LIPIcs.OPODIS.2019.16</a>
</li>
<li>
<span class="authors">Kyrill Winkler, Ulrich Schmid, and Yoram Moses</span>
<span class="title">A Characterization of Consensus Solvability for Closed Message Adversaries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.17">10.4230/LIPIcs.OPODIS.2019.17</a>
</li>
<li>
<span class="authors">Panagiota Fatourou, Nikolaos D. Kallimanis, and Eleni Kanellou</span>
<span class="title">An Efficient Universal Construction for Large Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.18">10.4230/LIPIcs.OPODIS.2019.18</a>
</li>
<li>
<span class="authors">Diego Cepeda, Sakib Chowdhury, Nan Li, Raphael Lopez, Xinzhe Wang, and Wojciech Golab</span>
<span class="title">Toward Linearizability Testing for Multi-Word Persistent Synchronization Primitives</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.19">10.4230/LIPIcs.OPODIS.2019.19</a>
</li>
<li>
<span class="authors">Itay Harel, Amit Jacob-Fanani, Moshe Sulamy, and Yehuda Afek</span>
<span class="title">Consensus in Equilibrium: Can One Against All Decide Fairly?</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.20">10.4230/LIPIcs.OPODIS.2019.20</a>
</li>
<li>
<span class="authors">Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid</span>
<span class="title">The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.21">10.4230/LIPIcs.OPODIS.2019.21</a>
</li>
<li>
<span class="authors">Tsuyoshi Gotoh, Paola Flocchini, Toshimitsu Masuzawa, and Nicola Santoro</span>
<span class="title">Tight Bounds on Distributed Exploration of Temporal Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.22">10.4230/LIPIcs.OPODIS.2019.22</a>
</li>
<li>
<span class="authors">Xiong Zheng and Vijay K. Garg</span>
<span class="title">Parallel and Distributed Algorithms for the Housing Allocation Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.23">10.4230/LIPIcs.OPODIS.2019.23</a>
</li>
<li>
<span class="authors">Shantanu Das, Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita</span>
<span class="title">Oblivious Permutations on the Plane</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.24">10.4230/LIPIcs.OPODIS.2019.24</a>
</li>
<li>
<span class="authors">Paola Flocchini, Nicola Santoro, and Koichi Wada</span>
<span class="title">On Memory, Communication, and Synchronous Schedulers When Moving and Computing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.25">10.4230/LIPIcs.OPODIS.2019.25</a>
</li>
<li>
<span class="authors">Sumi Acharjee, Konstantinos Georgiou, Somnath Kundu, and Akshaya Srinivasan</span>
<span class="title">Lower Bounds for Shoreline Searching With 2 or More Robots</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.26">10.4230/LIPIcs.OPODIS.2019.26</a>
</li>
<li>
<span class="authors">Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, and Koichi Wada</span>
<span class="title">Gathering on Rings for Myopic Asynchronous Robots With Lights</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.27">10.4230/LIPIcs.OPODIS.2019.27</a>
</li>
<li>
<span class="authors">Vassos Hadzilacos, Xing Hu, and Sam Toueg</span>
<span class="title">Optimal Register Construction in M&M Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.28">10.4230/LIPIcs.OPODIS.2019.28</a>
</li>
<li>
<span class="authors">Xiong Zheng, Vijay K. Garg, and John Kaippallimalil</span>
<span class="title">Linearizable Replicated State Machines With Lattice Agreement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.29">10.4230/LIPIcs.OPODIS.2019.29</a>
</li>
<li>
<span class="authors">Muhammad Samir Khan, Lewis Tseng, and Nitin H. Vaidya</span>
<span class="title">Exact Byzantine Consensus on Arbitrary Directed Graphs Under Local Broadcast Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.30">10.4230/LIPIcs.OPODIS.2019.30</a>
</li>
<li>
<span class="authors">Petr Kuznetsov, Thibault Rieutord, and Sara Tucci-Piergiovanni</span>
<span class="title">Reconfigurable Lattice Agreement and Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.31">10.4230/LIPIcs.OPODIS.2019.31</a>
</li>
<li>
<span class="authors">Yuval Emek, Noga Harlev, and Taisuke Izumi</span>
<span class="title">Towards Distributed Two-Stage Stochastic Optimization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.32">10.4230/LIPIcs.OPODIS.2019.32</a>
</li>
<li>
<span class="authors">Danupon Nanongkai and Michele Scquizzato</span>
<span class="title">Equivalence Classes and Conditional Hardness in Massively Parallel Computations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.33">10.4230/LIPIcs.OPODIS.2019.33</a>
</li>
<li>
<span class="authors">Yasamin Nazari</span>
<span class="title">Sparse Hopsets in Congested Clique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.34">10.4230/LIPIcs.OPODIS.2019.34</a>
</li>
<li>
<span class="authors">Michael Dinitz and Yasamin Nazari</span>
<span class="title">Massively Parallel Approximate Distance Sketches</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.OPODIS.2019.35">10.4230/LIPIcs.OPODIS.2019.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