LIPIcs, Volume 153, OPODIS 2019

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