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