LIPIcs, Volume 246, DISC 2022

• Christian Scheideler LIPIcs, Volume 246, DISC 2022, Complete Volume 10.4230/LIPIcs.DISC.2022
• Christian Scheideler Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.DISC.2022.0
• Sepehr Assadi Graph Coloring, Palette Sparsification, and Beyond (Invited Talk) 10.4230/LIPIcs.DISC.2022.1
• Roberto Baldoni Managing the Cyber Risk in a Decoupled World: Does This Bring Potential Opportunities in Computer Science? (Invited Talk) 10.4230/LIPIcs.DISC.2022.2
• Jennifer L. Welch Using Linearizable Objects in Randomized Concurrent Programs (Invited Talk) 10.4230/LIPIcs.DISC.2022.3
• Timothé Albouy, Davide Frey, Michel Raynal, and François Taïani Good-Case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case 10.4230/LIPIcs.DISC.2022.4
• Gal Amram, Avi Hayoun, Lior Mizrahi, and Gera Weiss Polynomial-Time Verification and Testing of Implementations of the Snapshot Data Structure 10.4230/LIPIcs.DISC.2022.5
• Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, and Themis Gouleakis Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts 10.4230/LIPIcs.DISC.2022.6
• John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, and Yadu Vasudev Byzantine Connectivity Testing in the Congested Clique 10.4230/LIPIcs.DISC.2022.7
• Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, and Jukka Suomela Efficient Classification of Locally Checkable Problems in Regular Trees 10.4230/LIPIcs.DISC.2022.8
• Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, and Jara Uitto Exponential Speedup over Locality in MPC with Optimal Memory 10.4230/LIPIcs.DISC.2022.9
• Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazić, Pierre Tholoniat, and Josef Widder Holistic Verification of Blockchain Consensus 10.4230/LIPIcs.DISC.2022.10
• Subhash Bhagat and Andrzej Pelc How to Meet at a Node of Any Connected Graph 10.4230/LIPIcs.DISC.2022.11
• Manuel Bravo, Gregory Chockler, and Alexey Gotsman Liveness and Latency of Byzantine State-Machine Replication 10.4230/LIPIcs.DISC.2022.12
• Martina Camaioni, Rachid Guerraoui, Matteo Monti, and Manuel Vidigueira Oracular Byzantine Reliable Broadcast 10.4230/LIPIcs.DISC.2022.13
• Pierre Civit, Muhammad Ayaz Dzulfikar, Seth Gilbert, Vincent Gramoli, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony! 10.4230/LIPIcs.DISC.2022.14
• Pierre Civit and Maria Potop-Butucaru Dynamic Probabilistic Input Output Automata 10.4230/LIPIcs.DISC.2022.15
• Varsha Dani and Thomas P. Hayes How to Wake up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks 10.4230/LIPIcs.DISC.2022.16
• Gianluca De Marco, Dariusz R. Kowalski, and Grzegorz Stachowiak Contention Resolution Without Collision Detection: Constant Throughput And Logarithmic Energy 10.4230/LIPIcs.DISC.2022.17
• Michael Dinitz, Jeremy Fineman, Seth Gilbert, and Calvin Newport Smoothed Analysis of Information Spreading in Dynamic Networks 10.4230/LIPIcs.DISC.2022.18
• Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, and David Peleg An Almost Singularly Optimal Asynchronous Distributed MST Algorithm 10.4230/LIPIcs.DISC.2022.19
• Yuval Emek, Yuval Gil, and Shay Kutten Locally Restricted Proof Labeling Schemes 10.4230/LIPIcs.DISC.2022.20
• David Eppstein and Hadi Khodabandeh Distributed Construction of Lightweight Spanners for Unit Ball Graphs 10.4230/LIPIcs.DISC.2022.21
• Manuela Fischer, Jeff Giliberti, and Christoph Grunau Improved Deterministic Connectivity in Massively Parallel Computation 10.4230/LIPIcs.DISC.2022.22
• Pierre Fraigniaud, Patrick Lambein-Monette, and Mikaël Rabie Fault Tolerant Coloring of the Asynchronous Cycle 10.4230/LIPIcs.DISC.2022.23
• Luciano Freitas, Petr Kuznetsov, and Andrei Tonkikh Distributed Randomness from Approximate Agreement 10.4230/LIPIcs.DISC.2022.24
• Chryssis Georgiou, Nicolas Nicolaou, and Andria Trigeorgi Fragmented ARES: Dynamic Storage for Large Objects 10.4230/LIPIcs.DISC.2022.25
• Magnús M. Halldórsson, Yannic Maus, and Alexandre Nolin Fast Distributed Vertex Splitting with Applications 10.4230/LIPIcs.DISC.2022.26
• Yael Hitron, Merav Parter, and Eylon Yogev Broadcast CONGEST Algorithms Against Eavesdroppers 10.4230/LIPIcs.DISC.2022.27
• Fabian Kuhn and Philipp Schneider Routing Schemes and Distance Oracles in the Hybrid Model 10.4230/LIPIcs.DISC.2022.28
• Oded Naor and Idit Keidar On Payment Channels in Asynchronous Money Transfer Systems 10.4230/LIPIcs.DISC.2022.29
• Sean Ovens The Space Complexity of Scannable Objects with Bounded Components 10.4230/LIPIcs.DISC.2022.30
• Merav Parter and Asaf Petruschka Near-Optimal Distributed Computation of Small Vertex Cuts 10.4230/LIPIcs.DISC.2022.31
• Merav Parter and Asaf Petruschka Õptimal Dual Vertex Failure Connectivity Labels 10.4230/LIPIcs.DISC.2022.32
• Youer Pu, Lorenzo Alvisi, and Ittay Eyal Safe Permissionless Consensus 10.4230/LIPIcs.DISC.2022.33
• Will Rosenbaum Packet Forwarding with a Locally Bursty Adversary 10.4230/LIPIcs.DISC.2022.34
• Pierre Sutra The Weakest Failure Detector for Genuine Atomic Multicast 10.4230/LIPIcs.DISC.2022.35
• Xing Hu and Sam Toueg On Implementing SWMR Registers from SWSR Registers in Systems with Byzantine Failures 10.4230/LIPIcs.DISC.2022.36
• Anatoliy Zinovyev Space-Stretch Tradeoff in Routing Revisited 10.4230/LIPIcs.DISC.2022.37
• Ittai Abraham, Danny Dolev, Alon Kagan, and Gilad Stern Brief Announcement: Authenticated Consensus in Synchronous Systems with Mixed Faults 10.4230/LIPIcs.DISC.2022.38
• Ittai Abraham, Natacha Crooks, Neil Giridharan, Heidi Howard, and Florian Suri-Payer Brief Announcement: It’s not easy to relax: liveness in chained BFT protocols 10.4230/LIPIcs.DISC.2022.39
• Sharareh Alipour and Mohammadhadi Salari Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach 10.4230/LIPIcs.DISC.2022.40
• Naama Ben-David, Michal Friedman, and Yuanhao Wei Brief Announcement: Survey of Persistent Memory Correctness Conditions 10.4230/LIPIcs.DISC.2022.41
• Wenkai Dai, Michael Dinitz, Klaus-Tycho Foerster, and Stefan Schmid Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies 10.4230/LIPIcs.DISC.2022.42
• Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, and Ioan Todinca Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks 10.4230/LIPIcs.DISC.2022.43
• Leszek Gąsieniec, Paul Spirakis, and Grzegorz Stachowiak Brief Announcement: New Clocks, Fast Line Formation and Self-Replication Population Protocols 10.4230/LIPIcs.DISC.2022.44
• Rosina F. Kharal and Trevor Brown Brief Announcement: Performance Anomalies in Concurrent Data Structure Microbenchmarks 10.4230/LIPIcs.DISC.2022.45
• Yonghwan Kim, Masahiro Shibata, Yuichi Sudo, Junya Nakamura, Yoshiaki Katayama, and Toshimitsu Masuzawa Brief Announcement: Gathering Despite Defected View 10.4230/LIPIcs.DISC.2022.46
• Irina Kostitsyna, Tom Peters, and Bettina Speckmann Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter 10.4230/LIPIcs.DISC.2022.47
• François Le Gall, Masayuki Miyamoto, and Harumichi Nishimura Brief Announcement: Distributed Quantum Interactive Proofs 10.4230/LIPIcs.DISC.2022.48
• Raïssa Nataf, Guy Goren, and Yoram Moses Brief Announcement: Null Messages, Information and Coordination 10.4230/LIPIcs.DISC.2022.49
• Jacob Nelson-Slivon, Lewis Tseng, and Roberto Palmieri Brief Announcement: Asymmetric Mutual Exclusion for RDMA 10.4230/LIPIcs.DISC.2022.50
• Shunhao Oh, Dana Randall, and Andréa W. Richa Brief Announcement: Foraging in Particle Systems via Self-Induced Phase Changes 10.4230/LIPIcs.DISC.2022.51
• Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, and Aleksandr Tereshchenko Brief Announcement: Temporal Locality in Online Algorithms 10.4230/LIPIcs.DISC.2022.52