LIPIcs, Volume 179, DISC 2020

• Hagit Attiya LIPIcs, Volume 179, DISC 2020, Complete Volume 10.4230/LIPIcs.DISC.2020
• Hagit Attiya Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.DISC.2020.0
• Sepehr Assadi, Aaron Bernstein, and Zachary Langley Improved Bounds for Distributed Load Balancing 10.4230/LIPIcs.DISC.2020.1
• Arik Rinberg and Idit Keidar Intermediate Value Linearizability: A Quantitative Correctness Criterion 10.4230/LIPIcs.DISC.2020.2
• Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, and Amirkeivan Mohtashami The Splay-List: A Distribution-Adaptive Concurrent Skip-List 10.4230/LIPIcs.DISC.2020.3
• Rachid Guerraoui, Alex Kogan, Virendra J. Marathe, and Igor Zablotchi Efficient Multi-Word Compare and Swap 10.4230/LIPIcs.DISC.2020.4
• Guy E. Blelloch and Yuanhao Wei LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS 10.4230/LIPIcs.DISC.2020.5
• Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, and Eric Severson Message Complexity of Population Protocols 10.4230/LIPIcs.DISC.2020.6
• Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, and Quentin Soubeyran Distributed Computation with Continual Population Growth 10.4230/LIPIcs.DISC.2020.7
• Aurélien Bellet, Rachid Guerraoui, and Hadrien Hendrikx Who Started This Rumor? Quantifying the Natural Differential Privacy of Gossip Protocols 10.4230/LIPIcs.DISC.2020.8
• George Giakkoupis, Hayk Saribekyan, and Thomas Sauerwald Spread of Information and Diseases via Random Walks in Sparse Graphs 10.4230/LIPIcs.DISC.2020.9
• Yael Hitron, Cameron Musco, and Merav Parter Spiking Neural Networks Through the Lens of Streaming Algorithms 10.4230/LIPIcs.DISC.2020.10
• Xavier Défago, Yuval Emek, Shay Kutten, Toshimitsu Masuzawa, and Yasumasa Tamura Communication Efficient Self-Stabilizing Leader Election 10.4230/LIPIcs.DISC.2020.11
• Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta, and Yukiko Yamauchi Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots 10.4230/LIPIcs.DISC.2020.12
• Sebastian Brandt, Julian Portmann, and Jara Uitto Tight Bounds for Deterministic High-Dimensional Grid Exploration 10.4230/LIPIcs.DISC.2020.13
• Guy Goren, Shay Vargaftik, and Yoram Moses Distributed Dispatching in the Parallel Server Model 10.4230/LIPIcs.DISC.2020.14
• Hsin-Hao Su and Hoa T. Vu Distributed Dense Subgraph Detection and Low Outdegree Orientation 10.4230/LIPIcs.DISC.2020.15
• Yannic Maus and Tigran Tonoyan Local Conflict Coloring Revisited: Linial for Lists 10.4230/LIPIcs.DISC.2020.16
• Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, and Jukka Suomela Classification of Distributed Binary Labeling Problems 10.4230/LIPIcs.DISC.2020.17
• Yi-Jun Chang The Complexity Landscape of Distributed Locally Checkable Problems on Trees 10.4230/LIPIcs.DISC.2020.18
• Ofer Grossman, Seri Khoury, and Ami Paz Improved Hardness of Approximation of Diameter in the CONGEST Model 10.4230/LIPIcs.DISC.2020.19
• Yuval Emek and Yuval Gil Twenty-Two New Approximate Proof Labeling Schemes 10.4230/LIPIcs.DISC.2020.20
• Merav Parter Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers 10.4230/LIPIcs.DISC.2020.21
• Shay Kutten, William K. Moses Jr., Gopal Pandurangan, and David Peleg Singularly Optimal Randomized Leader Election 10.4230/LIPIcs.DISC.2020.22
• Manuel Bravo, Gregory Chockler, and Alexey Gotsman Making Byzantine Consensus Live 10.4230/LIPIcs.DISC.2020.23
• Tuanir França Rezende and Pierre Sutra Leaderless State-Machine Replication: Specification, Properties, Limits 10.4230/LIPIcs.DISC.2020.24
• Shir Cohen, Idit Keidar, and Alexander Spiegelman Not a COINcidence: Sub-Quadratic Asynchronous Byzantine Agreement WHP 10.4230/LIPIcs.DISC.2020.25
• Oded Naor and Idit Keidar Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR 10.4230/LIPIcs.DISC.2020.26
• Petr Kuznetsov and Andrei Tonkikh Asynchronous Reconfiguration with Byzantine Failures 10.4230/LIPIcs.DISC.2020.27
• Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, and Zhuolun Xiang Improved Extension Protocols for Byzantine Broadcast and Agreement 10.4230/LIPIcs.DISC.2020.28
• Diana Ghinea, Martin Hirt, and Chen-Da Liu-Zhang From Partial to Global Asynchronous Reliable Broadcast 10.4230/LIPIcs.DISC.2020.29
• Bogdan S. Chlebus, Dariusz R. Kowalski, and Jan Olkowski Fast Agreement in Networks with Byzantine Nodes 10.4230/LIPIcs.DISC.2020.30
• John Augustine, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, and Jared Saia Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols 10.4230/LIPIcs.DISC.2020.31
• Xiong Zheng and Vijay Garg Byzantine Lattice Agreement in Synchronous Message Passing Systems 10.4230/LIPIcs.DISC.2020.32
• Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, and Rotem Oshman Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs 10.4230/LIPIcs.DISC.2020.33
• Mohsen Ghaffari, Christoph Grunau, and Ce Jin Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond 10.4230/LIPIcs.DISC.2020.34
• Ken-ichi Kawarabayashi, Seri Khoury, Aaron Schild, and Gregory Schwartzman Improved Distributed Approximations for Maximum Independent Set 10.4230/LIPIcs.DISC.2020.35
• Uri Meir, Ami Paz, and Gregory Schwartzman Models of Smoothing in Dynamic Networks 10.4230/LIPIcs.DISC.2020.36
• Mohamad Ahmadi and Fabian Kuhn Distributed Maximum Matching Verification in CONGEST 10.4230/LIPIcs.DISC.2020.37
• Merav Parter Distributed Planar Reachability in Nearly Optimal Time 10.4230/LIPIcs.DISC.2020.38
• Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Alexandre Nolin Coloring Fast Without Learning Your Neighbors' Colors 10.4230/LIPIcs.DISC.2020.39
• Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping 10.4230/LIPIcs.DISC.2020.40
• Yi-Jun Chang, Jan Studený, and Jukka Suomela Brief Announcement: Distributed Graph Problems Through an Automata-Theoretic Lens 10.4230/LIPIcs.DISC.2020.41
• Emilio Cruciani, Hlafo Alfie Mimun, Matteo Quattropani, and Sara Rizzo Brief Announcement: Phase Transitions of the k-Majority Dynamics in a Biased Communication Model 10.4230/LIPIcs.DISC.2020.42
• Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, and Ami Paz Brief Announcement: Distributed Quantum Proofs for Replicated Data 10.4230/LIPIcs.DISC.2020.43
• Ashish Choudhury Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited 10.4230/LIPIcs.DISC.2020.44
• Pierre Civit, Seth Gilbert, and Vincent Gramoli Brief Announcement: Polygraph: Accountable Byzantine Agreement 10.4230/LIPIcs.DISC.2020.45
• Klaus-Tycho Foerster, Juho Hirvonen, Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tredan Brief Announcement: What Can(Not) Be Perfectly Rerouted Locally 10.4230/LIPIcs.DISC.2020.46
• Ittai Abraham, Kartik Nayak, Ling Ren, and Zhuolun Xiang Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency 10.4230/LIPIcs.DISC.2020.47
• Martin Hirt, Ard Kastrati, and Chen-Da Liu-Zhang Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus 10.4230/LIPIcs.DISC.2020.48
• Paolo Zappalà, Marianna Belotti, Maria Potop-Butucaru, and Stefano Secci Brief Announcement: Game Theoretical Framework for Analyzing Blockchains Robustness 10.4230/LIPIcs.DISC.2020.49
• Dolev Adas and Roy Friedman Brief Announcement: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue 10.4230/LIPIcs.DISC.2020.50
• Guy E. Blelloch and Yuanhao Wei Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time 10.4230/LIPIcs.DISC.2020.51
• Haosen Wen, Wentao Cai, Mingzhe Du, Benjamin Valpey, and Michael L. Scott Brief Announcement: Building Fast Recoverable Persistent Data Structures with Montage 10.4230/LIPIcs.DISC.2020.52
• Lewis Tseng, Qinzi Zhang, and Yifan Zhang Brief Announcement: Reaching Approximate Consensus When Everyone May Crash 10.4230/LIPIcs.DISC.2020.53
• Petr Kuznetsov and Thibault Rieutord Brief Announcement: On Decidability of 2-Process Affine Models 10.4230/LIPIcs.DISC.2020.54