Double-blind review

We will use double-blind peer review in OPODIS 2019. All submissions must be anonymous. We will use a somewhat relaxed implementation of double-blind peer review in OPODIS 2019: you are free to disseminate your work through arXiv and other online repositories and give presentations on your work as usual. However, please make sure you do not mention your own name or affiliation in the submission, and please do not include obvious references that reveal your identity. A reviewer who has not previously seen the paper should be able to read it without accidentally learning the identity of the authors. Please feel free to ask the PC chairs if you have any questions about the double-blind policy of OPODIS 2019.

Submissions

Papers are to be submitted electronically through EasyChair at the following Submission link (https://easychair.org/conferences/?conf=opodis19). Submissions must be in English in pdf format and they must be prepared using the LaTeX style templates for LIPIcs and choosing the A4 paper option. A submission must not exceed 16 pages, including the cover page, figures, tables and references. The cover page should include the title of the paper, a list of keywords, and an abstract of 1 to 2 paragraphs summarizing the contributions of the submission. The submission must contain a clear presentation of the merits of the paper, including discussion of its importance, prior work, and an outline of key technical ideas and methods used to achieve the main claims. All of the ideas necessary for an expert to fully verify the central claims in the submission, including experimental results, should be included either in the submission or in a clearly marked appendix. The appendix will be read at the discretion of the reviewers. If desired, the appendix can be a copy of the full paper. A submission must report on original research that has not previously appeared in a journal or conference with published proceedings. It should not be concurrently submitted to such a journal or conference. Any overlap with a published or concurrently submitted paper must be clearly indicated. The Program Chairs reserve the right to reject submissions that are out of scope, of clearly inferior quality, or that violate the submission guidelines. Each of the remaining papers will undergo a thorough reviewing process.

Publication

OPODIS has post-proceedings published by Leibniz International Proceedings in Informatics (LIPIcs) in gold open access mode. The proceedings become available online, free of charge, after the conference. Preliminary versions of the proceedings will be available to participants at the conference electronically. The camera-ready version of a paper must have the same format and be of the same length as its submitted version.

Awards

Awards will be given to the best paper and the best student paper (i.e., primarily written by a student). Eligibility for the best student paper award should be clearly indicated on the cover page.

• Kfir Lev-Ari, Alexander Spiegelman, Idit Keidar and Dahlia Malkhi. FairLedger: A Fair Blockchain Protocol for Financial Institutions
• Weihai Yu, Victorien Elvinger and Claudia-Lavinia Ignat. A Generic Undo Support for State-Based CRDTs
• Sumi Acharjee, Konstantinos Georgiou, Somnath Kundu and Akshaya Srinivasan. Lower Bounds for Shoreline Searching with 2 or More Robots
• Álvaro García-Pérez and Maria A. Schett. Deconstructing Stellar Consensus
• Xiong Zheng, Vijay Garg and John Kaippallimalil. Linearizable Replicated State Machines with Lattice Agreement
• Xiong Zheng and Vijay Garg. Parallel and Distributed Algorithms for the Housing Allocation Problem
• Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sebastien Tixeuil and Koichi Wada. Gathering on Rings for Myopic Asynchronous Robots with Lights
• Ran Gelles and Siddharth Iyer. Interactive coding resilient to an unknown number of erasures
• Christian Cachin and Björn Tackmann. Asymmetric Distributed Trust
• Petr Kuznetsov, Thibault Rieutord and Sara Tucci-Piergiovanni. Reconfigurable Lattice Agreement and Applications
• Hiroto Yasumi, Fukuhito Ooshita and Michiko Inoue. Uniform Partition in Population Protocol Model under Weak Fairness
• Itay Harel, Amit Jacob-Fanani, Moshe Sulamy and Yehuda Afek. Consensus in Equilibrium: Can One Against All Decide Fairly?
• Kishori Konwar, N Prakash, Medard Muriel and Nancy Lynch. Fast Lean Erasure-coded Atomic Memory Object
• Paola Flocchini, Nicola Santoro and Koichi Wada. On Memory, Communication, and Synchronous Schedulers when Moving and Computing
• Kyrill Winkler, Ulrich Schmid and Yoram Moses. A Characterization of Consensus Solvability for Closed Message Adversaries
• Alex Auvolat, Michel Raynal and François Taïani. Byzantine-Tolerant Set-Constrained Delivery Broadcast
• Laura Schmid, Krishnendu Chatterjee and Stefan Schmid. The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game
• Vassos Hadzilacos, Xing Hu and Sam Toueg. Optimal Register Construction in M&M Systems
• Muhammad Khan, Lewis Tseng and Nitin Vaidya. Exact Byzantine Consensus on Arbitrary Directed Graphs under Local Broadcast Model
• Diego Cepeda, Sakib Chowdhury, Nan Li, Raphael Lopez, Xinzhe Wang and Wojciech Golab. Toward Linearizability Testing for Multi-Word Persistent Synchronization Primitives
• Nikita Koval, Dan Alistarh and Alexander Fedorov. In Search of the Fastest Concurrent Union-Find Algorithm
• Yuval Emek, Noga Harlev and Taisuke Izumi. Towards Distributed Two-Stage Stochastic Optimization
• Tsuyoshi Gotoh, Paola Flocchini, Toshimitsu Masuzawa and Nicola Santoro. Tight Bounds on Distributed Exploration of Temporal Graphs
• Danupon Nanongkai and Michele Scquizzato. Equivalence Classes and Conditional Hardness in Massively Parallel Computations
• Michael Dinitz and Yasamin Nazari. Massively Parallel Approximate Distance Sketches
• Yasamin Nazari. Sparse Hopsets in Congested Clique
• Panagiota Fatourou, Nikolaos D. Kallimanis and Eleni Kanellou. An Efficient Universal Construction for Large Objects
• Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta and Masafumi Yamashita. Oblivious Permutations on the Plane
• Genc Tato, Marin Bertier, Etienne Rivière and Cédric Tedeschi. Split and migrate: Resource-driven placement and discovery of microservices at the edge
• Felipe de Azevedo Piovezan, Vassos Hadzilacos and Sam Toueg. On deterministic linearizable set agreement objects
• Zhanhao Chen, Ahmed Hassan, Masoomeh Javidi Kishi, Jacob Nelson and Roberto Palmieri. HaTS: Hardware-assisted Transaction Scheduler
• Nuno Machado, Francisco Maia, Francisco Neves, Fábio André Coelho and Jose Pereira. Minha: Large-Scale Distributed Systems Testing Made Practical