LIPIcs, Volume 184, OPODIS 2020

• Quentin Bramas, Rotem Oshman, and Paolo Romano LIPIcs, Volume 184, OPODIS 2020, Complete Volume 10.4230/LIPIcs.OPODIS.2020
• Quentin Bramas, Rotem Oshman, and Paolo Romano Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.OPODIS.2020.0
• Pascal Felber Big Data Processing: Security and Scalability Challenges (Invited Talk) 10.4230/LIPIcs.OPODIS.2020.1
• Idit Keidar Byzantine Agreement and SMR with Sub-Quadratic Message Complexity (Invited Talk) 10.4230/LIPIcs.OPODIS.2020.2
• Jukka Suomela Can We Automate Our Own Work - or Show That It Is Hard? (Invited Talk) 10.4230/LIPIcs.OPODIS.2020.3
• Xiong Zheng and Vijay Garg Byzantine Lattice Agreement in Asynchronous Systems 10.4230/LIPIcs.OPODIS.2020.4
• Isaac Sheff, Xinwen Wang, Robbert van Renesse, and Andrew C. Myers Heterogeneous Paxos 10.4230/LIPIcs.OPODIS.2020.5
• Martin Hirt, Ard Kastrati, and Chen-Da Liu-Zhang Multi-Threshold Asynchronous Reliable Broadcast and Consensus 10.4230/LIPIcs.OPODIS.2020.6
• Qinzi Zhang and Lewis Tseng Echo-CGC: A Communication-Efficient Byzantine-Tolerant Distributed Machine Learning Algorithm in Single-Hop Radio Network 10.4230/LIPIcs.OPODIS.2020.7
• Amine Boussetta, El-Mahdi El-Mhamdi, Rachid Guerraoui, Alexandre Maurer, and Sébastien Rouault AKSEL: Fast Byzantine SGD 10.4230/LIPIcs.OPODIS.2020.8
• Alexander Spiegelman, Arik Rinberg, and Dahlia Malkhi ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication 10.4230/LIPIcs.OPODIS.2020.9
• Ignacio Amores-Sesar, Christian Cachin, and Jovana Mićić Security Analysis of Ripple Consensus 10.4230/LIPIcs.OPODIS.2020.10
• Ittai Abraham and Gilad Stern Information Theoretic HotStuff 10.4230/LIPIcs.OPODIS.2020.11
• Yackolley Amoussou-Guenou, Bruno Biais, Maria Potop-Butucaru, and Sara Tucci-Piergiovanni Rational Behaviors in Committee-Based Blockchains 10.4230/LIPIcs.OPODIS.2020.12
• Armando Castañeda, Sergio Rajsbaum, and Michel Raynal Relaxed Queues and Stacks from Read/Write Operations 10.4230/LIPIcs.OPODIS.2020.13
• Dempsey Wade and Edward Talmage Fast and Space-Efficient Queues via Relaxation 10.4230/LIPIcs.OPODIS.2020.14
• Daniel Katzan and Adam Morrison Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity 10.4230/LIPIcs.OPODIS.2020.15
• Hagit Attiya, Sweta Kumari, and Noa Schiller Optimal Resilience in Systems That Mix Shared Memory and Message Passing 10.4230/LIPIcs.OPODIS.2020.16
• Soukaina Firmli, Vasileios Trigonakis, Jean-Pierre Lozi, Iraklis Psaroudakis, Alexander Weld, Dalila Chiadmi, Sungpack Hong, and Hassan Chafi CSR++: A Fast, Scalable, Update-Friendly Graph Data Structure 10.4230/LIPIcs.OPODIS.2020.17
• Hagit Attiya, Armando Castañeda, and Sergio Rajsbaum Locally Solvable Tasks and the Limitations of Valency Arguments 10.4230/LIPIcs.OPODIS.2020.18
• Talley Amir, James Aspnes, and John Lazarsfeld Approximate Majority with Catalytic Inputs 10.4230/LIPIcs.OPODIS.2020.19
• Ritam Ganguly, Anik Momtaz, and Borzoo Bonakdarpour Distributed Runtime Verification Under Partial Synchrony 10.4230/LIPIcs.OPODIS.2020.20
• Mahboubeh Samadi, Fatemeh Ghassemi, and Ramtin Khosravi Decentralized Runtime Enforcement of Message Sequences in Message-Based Systems 10.4230/LIPIcs.OPODIS.2020.21
• Haimin Chen and Chaodong Zheng Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks 10.4230/LIPIcs.OPODIS.2020.22
• Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, and Andrei Tonkikh Dynamic Byzantine Reliable Broadcast 10.4230/LIPIcs.OPODIS.2020.23
• Shantanu Das, Nikos Giachoudis, Flaminia L. Luccio, and Euripides Markou Broadcasting with Mobile Agents in Dynamic Networks 10.4230/LIPIcs.OPODIS.2020.24
• Chen-Da Liu-Zhang, Varun Maram, and Ueli Maurer On Broadcast in Generalized Network and Adversarial Models 10.4230/LIPIcs.OPODIS.2020.25
• Mahmoud Parham, Klaus-Tycho Foerster, Petar Kosic, and Stefan Schmid Maximally Resilient Replacement Paths for a Family of Product Graphs 10.4230/LIPIcs.OPODIS.2020.26
• Alexandre Maurer Self-Stabilizing Byzantine-Resilient Communication in Dynamic Networks 10.4230/LIPIcs.OPODIS.2020.27
• Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, and Gregory Schwartzman Fast Deterministic Algorithms for Highly-Dynamic Networks 10.4230/LIPIcs.OPODIS.2020.28
• Salwa Faour and Fabian Kuhn Approximating Bipartite Minimum Vertex Cover in the CONGEST Model 10.4230/LIPIcs.OPODIS.2020.29
• Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, and Virginia Vassilevska Williams Distributed Distance Approximation 10.4230/LIPIcs.OPODIS.2020.30
• Michael Feldmann, Kristian Hinnenthal, and Christian Scheideler Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs 10.4230/LIPIcs.OPODIS.2020.31
• Leonid Barenboim and Harel Levin Secured Distributed Algorithms Without Hardness Assumptions 10.4230/LIPIcs.OPODIS.2020.32
• Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, and Sébastien Tixeuil Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs 10.4230/LIPIcs.OPODIS.2020.33