LIPIcs, Volume 253, OPODIS 2022

• Eshcar Hillel, Roberto Palmieri, and Etienne Rivière LIPIcs, Volume 253, OPODIS 2022, Complete Volume 10.4230/LIPIcs.OPODIS.2022
• Eshcar Hillel, Roberto Palmieri, and Etienne Rivière Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.OPODIS.2022.0
• Victor Luchangco Theory Meets Practice in the Algorand Blockchain (Invited Talk) 10.4230/LIPIcs.OPODIS.2022.1
• Panagiota Fatourou Recoverable Computing (Invited Talk) 10.4230/LIPIcs.OPODIS.2022.2
• Sébastien Tixeuil Realistic Self-Stabilization (Invited Talk) 10.4230/LIPIcs.OPODIS.2022.3
• Colette Johnen, Adnane Khattabi, and Alessia Milani Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers 10.4230/LIPIcs.OPODIS.2022.4
• Gali Sheffi, Pedro Ramalhete, and Erez Petrank EEMARQ: Efficient Lock-Free Range Queries with Memory Reclamation 10.4230/LIPIcs.OPODIS.2022.5
• Hagit Attiya and Faith Ellen The Step Complexity of Multidimensional Approximate Agreement 10.4230/LIPIcs.OPODIS.2022.6
• Rosina F. Kharal and Trevor Brown Performance Anomalies in Concurrent Data Structure Microbenchmarks 10.4230/LIPIcs.OPODIS.2022.7
• Enrique Fynn, Ethan Buchman, Zarko Milosevic, Robert Soulé, and Fernando Pedone Robust and Fast Blockchain State Synchronization 10.4230/LIPIcs.OPODIS.2022.8
• Rodrigo Q. Saramago, Hein Meling, and Leander N. Jehl A Privacy-Preserving and Transparent Certification System for Digital Credentials 10.4230/LIPIcs.OPODIS.2022.9
• Ignacio Amores-Sesar, Christian Cachin, and Enrico Tedeschi When Is Spring Coming? A Security Analysis of Avalanche Consensus 10.4230/LIPIcs.OPODIS.2022.10
• Taichi Inoue, Naoki Kitamura, Taisuke Izumi, and Toshimitsu Masuzawa Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs 10.4230/LIPIcs.OPODIS.2022.11
• Jared Coleman, Evangelos Kranakis, Danny Krizanc, and Oscar Morales-Ponce Line Search for an Oblivious Moving Target 10.4230/LIPIcs.OPODIS.2022.12
• John Augustine, Arnhav Datar, and Nischith Shadagopan Randomized Byzantine Gathering in Rings 10.4230/LIPIcs.OPODIS.2022.13
• Yonghwan Kim, Masahiro Shibata, Yuichi Sudo, Junya Nakamura, Yoshiaki Katayama, and Toshimitsu Masuzawa Gathering of Mobile Robots with Defected Views 10.4230/LIPIcs.OPODIS.2022.14
• Jannik Castenow, Jonas Harbig, Daniel Jung, Peter Kling, Till Knollmann, and Friedhelm Meyer auf der Heide A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility 10.4230/LIPIcs.OPODIS.2022.15
• Ittai Abraham and Gilad Stern New Dolev-Reischuk Lower Bounds Meet Blockchain Eclipse Attacks 10.4230/LIPIcs.OPODIS.2022.16
• Christian Cachin, Giuliano Losa, and Luca Zanolini Quorum Systems in Permissionless Networks 10.4230/LIPIcs.OPODIS.2022.17
• Shir Cohen, Idit Keidar, and Alexander Spiegelman Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words 10.4230/LIPIcs.OPODIS.2022.18
• Sarah Azouvi, Christian Cachin, Duc V. Le, Marko Vukolić, and Luca Zanolini Modeling Resources in Permissionless Longest-Chain Total-Order Broadcast 10.4230/LIPIcs.OPODIS.2022.19
• Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, and Ioan Todinca Computing Power of Hybrid Models in Synchronous Networks 10.4230/LIPIcs.OPODIS.2022.20
• Darya Melnyk, Jukka Suomela, and Neven Villani Mending Partial Solutions with Few Changes 10.4230/LIPIcs.OPODIS.2022.21
• Shihao Liu The Impossibility of Approximate Agreement on a Larger Class of Graphs 10.4230/LIPIcs.OPODIS.2022.22
• Petra Berenbrink, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Dominik Kaaser, and Malin Rau On the Hierarchy of Distributed Majority Protocols 10.4230/LIPIcs.OPODIS.2022.23
• Sravya Yandamuri, Ittai Abraham, Kartik Nayak, and Michael K. Reiter Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption 10.4230/LIPIcs.OPODIS.2022.24
• Neta Rozen-Schiff, Klaus-Tycho Foerster, Stefan Schmid, and David Hay Chopin: Combining Distributed and Centralized Schedulers for Self-Adjusting Datacenter Networks 10.4230/LIPIcs.OPODIS.2022.25
• Timothé Albouy, Davide Frey, Michel Raynal, and François Taïani A Modular Approach to Construct Signature-Free BRB Algorithms Under a Message Adversary 10.4230/LIPIcs.OPODIS.2022.26
• Yuval Emek, Yuval Gil, and Noga Harlev Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach 10.4230/LIPIcs.OPODIS.2022.27
• Bernadette Charron-Bost and Louis Penet de Monterno Self-Stabilizing Clock Synchronization in Dynamic Networks 10.4230/LIPIcs.OPODIS.2022.28