LIPIcs, Volume 146, DISC 2019

• Jukka Suomela LIPIcs, Volume 146, DISC'19, Complete Volume 10.4230/LIPIcs.DISC.2019
• Jukka Suomela Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.DISC.2019.0
• James Aspnes and He Yang Er Consensus with Max Registers 10.4230/LIPIcs.DISC.2019.1
• Hagit Attiya and Constantin Enea Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs That Use Concurrent Objects 10.4230/LIPIcs.DISC.2019.2
• Mirza Ahad Baig, Danny Hendler, Alessia Milani, and Corentin Travers Long-Lived Counters with Polylogarithmic Amortized Step Complexity 10.4230/LIPIcs.DISC.2019.3
• Ruben Becker, Yuval Emek, Mohsen Ghaffari, and Christoph Lenzen Distributed Algorithms for Low Stretch Spanning Trees 10.4230/LIPIcs.DISC.2019.4
• Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi, and Gregory Schwartzman Optimal Distributed Covering Algorithms 10.4230/LIPIcs.DISC.2019.5
• Ran Ben-Basat, Ken-ichi Kawarabayashi, and Gregory Schwartzman Parameterized Distributed Algorithms 10.4230/LIPIcs.DISC.2019.6
• Shimon Bitton, Yuval Emek, Taisuke Izumi, and Shay Kutten Message Reduction in the LOCAL Model Is a Free Lunch 10.4230/LIPIcs.DISC.2019.7
• Mark Braverman, Gillat Kol, Rotem Oshman, and Avishay Tal On the Computational Power of Radio Channels 10.4230/LIPIcs.DISC.2019.8
• Janna Burman, Joffroy Beauquier, and Devan Sohier Space-Optimal Naming in Population Protocols 10.4230/LIPIcs.DISC.2019.9
• Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, and Goran Zuzic Erasure Correction for Noisy Radio Networks 10.4230/LIPIcs.DISC.2019.10
• Shiri Chechik and Doron Mukhtar Reachability and Shortest Paths in the Broadcast CONGEST Model 10.4230/LIPIcs.DISC.2019.11
• Ran Cohen, Iftach Haitner, Nikolaos Makriyannis, Matan Orland, and Alex Samorodnitsky On the Round Complexity of Randomized Byzantine Agreement 10.4230/LIPIcs.DISC.2019.12
• Pierluigi Crescenzi, Pierre Fraigniaud, and Ami Paz Trade-Offs in Distributed Interactive Proofs 10.4230/LIPIcs.DISC.2019.13
• Michael Dinitz, Magnús M. Halldórsson, Calvin Newport, and Alex Weaver The Capacity of Smartphone Peer-To-Peer Networks 10.4230/LIPIcs.DISC.2019.14
• Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, and Rotem Oshman Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles 10.4230/LIPIcs.DISC.2019.15
• Orr Fischer and Rotem Oshman A Distributed Algorithm for Directed Minimum-Weight Spanning Tree 10.4230/LIPIcs.DISC.2019.16
• Paweł Garncarek, Tomasz Jurdziński, and Dariusz R. Kowalski Stable Memoryless Queuing under Contention 10.4230/LIPIcs.DISC.2019.17
• Mohsen Ghaffari and Julian Portmann Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond 10.4230/LIPIcs.DISC.2019.18
• Seth Gilbert, James Maguire, and Calvin Newport On Bioelectric Algorithms 10.4230/LIPIcs.DISC.2019.19
• Seth Gilbert and Wei Quan Lim Parallel Finger Search Structures 10.4230/LIPIcs.DISC.2019.20
• Éric Goubault, Marijana Lazić, Jérémy Ledent, and Sergio Rajsbaum Wait-Free Solvability of Equality Negation Tasks 10.4230/LIPIcs.DISC.2019.21
• Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, and Dragos-Adrian Seredinschi Scalable Byzantine Reliable Broadcast 10.4230/LIPIcs.DISC.2019.22
• Kristian Hinnenthal, Christian Scheideler, and Martijn Struijs Fast Distributed Algorithms for LP-Type Problems of Low Dimension 10.4230/LIPIcs.DISC.2019.23
• Artem Khyzha, Hagit Attiya, and Alexey Gotsman Privatization-Safe Transactional Memories 10.4230/LIPIcs.DISC.2019.24
• Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, and Taisuke Izumi Low-Congestion Shortcut and Graph Parameters 10.4230/LIPIcs.DISC.2019.25
• Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, and Peter Robinson The Complexity of Symmetry Breaking in Massive Graphs 10.4230/LIPIcs.DISC.2019.26
• Giuliano Losa, Eli Gafni, and David Mazières Stellar Consensus by Instantiation 10.4230/LIPIcs.DISC.2019.27
• Ruslan Nikolaev A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue 10.4230/LIPIcs.DISC.2019.28
• Thomas Nowak and Joel Rybicki Byzantine Approximate Agreement on Graphs 10.4230/LIPIcs.DISC.2019.29
• Merav Parter Small Cuts and Connectivity Certificates: A Fault Tolerant Approach 10.4230/LIPIcs.DISC.2019.30
• Adones Rukundo, Aras Atalar, and Philippas Tsigas Monotonically Relaxing Concurrent Data-Structure Semantics for Increasing Performance: An Efficient 2D Design Framework 10.4230/LIPIcs.DISC.2019.31
• Nobutaka Shimizu and Takeharu Shiraga Phase Transitions of Best-of-Two and Best-of-Three on Stochastic Block Models 10.4230/LIPIcs.DISC.2019.32
• Hsin-Hao Su and Hoa T. Vu Distributed Data Summarization in Well-Connected Networks 10.4230/LIPIcs.DISC.2019.33
• Mohammad Taheri, Arash Pourdamghani, and Mohsen Lesani Polynomial-Time Fence Insertion for Structured Programs 10.4230/LIPIcs.DISC.2019.34
• Chen Avin, Iosif Salem, and Stefan Schmid Brief Announcement: On Self-Adjusting Skip List Networks 10.4230/LIPIcs.DISC.2019.35
• Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, and Hamed Saleh Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring 10.4230/LIPIcs.DISC.2019.36
• Lélia Blin, Laurent Feuilloley, and Gabriel Le Bouder Brief Announcement: Memory Lower Bounds for Self-Stabilization 10.4230/LIPIcs.DISC.2019.37
• Grégoire Bonin, Achour Mostéfaoui, and Matthieu Perrin Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model 10.4230/LIPIcs.DISC.2019.38
• Christian Cachin and Björn Tackmann Brief Announcement: Asymmetric Distributed Trust 10.4230/LIPIcs.DISC.2019.39
• Vicent Cholvi, Antonio Fernández Anta, Chryssis Georgiou, and Nicolas Nicolaou Brief Announcement: Implementing Byzantine Tolerant Distributed Ledger Objects 10.4230/LIPIcs.DISC.2019.40
• Xavier Défago, Adam Heriban, Sébastien Tixeuil, and Koichi Wada Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space 10.4230/LIPIcs.DISC.2019.41
• Michael Dinitz and Yasamin Nazari Brief Announcement: Massively Parallel Approximate Distance Sketches 10.4230/LIPIcs.DISC.2019.42
• Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, and Koichi Wada Brief Announcement: Neighborhood Mutual Remainder and Its Self-Stabilizing Implementation of Look-Compute-Move Robots 10.4230/LIPIcs.DISC.2019.43
• Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi Brief Announcement: Revisiting Consensus Protocols through Wait-Free Parallelization 10.4230/LIPIcs.DISC.2019.44
• Jelle Hellings and Mohammad Sadoghi Brief Announcement: The Fault-Tolerant Cluster-Sending Problem 10.4230/LIPIcs.DISC.2019.45
• Masoomeh Javidi Kishi, Ahmed Hassan, and Roberto Palmieri Brief Announcement: On the Correctness of Transaction Processing with External Dependency 10.4230/LIPIcs.DISC.2019.46
• Chen-Da Liu-Zhang, Varun Maram, and Ueli Maurer Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models 10.4230/LIPIcs.DISC.2019.47
• Nancy Lynch and Mien Brabeeba Wang Brief Announcement: Integrating Temporal Information to Spatial Information in a Neural Circuit 10.4230/LIPIcs.DISC.2019.48
• Ali Mashreghi and Valerie King Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication 10.4230/LIPIcs.DISC.2019.49