LIPIcs, Volume 91, DISC 2017

Andréa W. Richa LIPIcs, Volume 91, DISC'17, Complete Volume 10.4230/LIPIcs.DISC.2017
Andréa Richa Front Matter, Table of Contents, Preface, Symposium Organization, Awards 10.4230/LIPIcs.DISC.2017.0
Christian Cachin and Marko Vukolic Blockchain Consensus Protocols in the Wild (Keynote Talk) 10.4230/LIPIcs.DISC.2017.1
Anne-Marie Kermarrec Recommenders: from the Lab to the Wild (Keynote Talk) 10.4230/LIPIcs.DISC.2017.2
Dana Randall Phase Transitions and Emergent Phenomena in Random Structures and Algorithms (Keynote Talk) 10.4230/LIPIcs.DISC.2017.3
Maya Arbel-Raviv and Trevor Brown Reuse, Don't Recycle: Transforming Lock-Free Algorithms That Throw Away Descriptors 10.4230/LIPIcs.DISC.2017.4
Chen Avin, Kaushik Mondal, and Stefan Schmid Demand-Aware Network Designs of Bounded Degree 10.4230/LIPIcs.DISC.2017.5
Alkida Balliu and Pierre Fraigniaud Certification of Compact Low-Stretch Routing Schemes 10.4230/LIPIcs.DISC.2017.6
Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, and Christoph Lenzen Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models 10.4230/LIPIcs.DISC.2017.7
Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois, and Franck Petit Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm 10.4230/LIPIcs.DISC.2017.8
Trevor Brown and Srivatsan Ravi Cost of Concurrency in Hybrid Transactional Memory 10.4230/LIPIcs.DISC.2017.9
Keren Censor-Hillel, Seri Khoury, and Ami Paz Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model 10.4230/LIPIcs.DISC.2017.10
Keren Censor-Hillel, Merav Parter, and Gregory Schwartzman Derandomizing Local Distributed Algorithms under Bandwidth Restrictions 10.4230/LIPIcs.DISC.2017.11
David Yu Cheng Chan, Vassos Hadzilacos, and Sam Toueg On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects 10.4230/LIPIcs.DISC.2017.12
Colin Cooper, Tomasz Radzik, Nicolás Rivera, and Takeharu Shiraga Fast Plurality Consensus in Regular Expanders 10.4230/LIPIcs.DISC.2017.13
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Masafumi Yamashita Meeting in a Polygon by Anonymous Oblivious Robots 10.4230/LIPIcs.DISC.2017.14
Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, and Ioan Todinca Three Notes on Distributed Property Testing 10.4230/LIPIcs.DISC.2017.15
Laurent Feuilloley and Pierre Fraigniaud Error-Sensitive Proof-Labeling Schemes 10.4230/LIPIcs.DISC.2017.16
Manuela Fischer Improved Deterministic Distributed Matching via Rounding 10.4230/LIPIcs.DISC.2017.17
Manuela Fischer and Mohsen Ghaffari Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy 10.4230/LIPIcs.DISC.2017.18
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, and Jara Uitto Improved Distributed Degree Splitting and Edge Coloring 10.4230/LIPIcs.DISC.2017.19
Mohsen Ghaffari and Christiana Lymouri Simple and Near-Optimal Distributed Coloring for Sparse Graphs 10.4230/LIPIcs.DISC.2017.20
Mohsen Ghaffari and Merav Parter Near-Optimal Distributed DFS in Planar Graphs 10.4230/LIPIcs.DISC.2017.21
Abdolhamid Ghodselahi and Fabian Kuhn Dynamic Analysis of the Arrow Distributed Directory Protocol in General Networks 10.4230/LIPIcs.DISC.2017.22
Alexey Gotsman and Sebastian Burckhardt Consistency Models with Global Operation Sequencing and their Composition 10.4230/LIPIcs.DISC.2017.23
Ofer Grossman and Merav Parter Improved Deterministic Distributed Construction of Spanners 10.4230/LIPIcs.DISC.2017.24
Magnús M. Halldórsson, Fabian Kuhn, Nancy Lynch, and Calvin Newport An Efficient Communication Abstraction for Dense Wireless Networks 10.4230/LIPIcs.DISC.2017.25
Itay Hazan and Eyal Kushilevitz Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity 10.4230/LIPIcs.DISC.2017.26
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, and Michel Raynal Which Broadcast Abstraction Captures k-Set Agreement? 10.4230/LIPIcs.DISC.2017.27
Shady Issa, Pascal Felber, Alexander Matveev, and Paolo Romano Extending Hardware Transactional Memory Capacity via Rollback-Only Transactions and Suspend/Resume 10.4230/LIPIcs.DISC.2017.28
Irvan Jahja, Haifeng Yu, and Yuda Zhao Some Lower Bounds in Dynamic Networks with Oblivious Adversaries 10.4230/LIPIcs.DISC.2017.29
Prasad Jayanti and Anup Joshi Recoverable FCFS Mutual Exclusion with Wait-Free Recovery 10.4230/LIPIcs.DISC.2017.30
Gillat Kol, Rotem Oshman, and Dafna Sadeh Interactive Compression for Multi-Party Protocol 10.4230/LIPIcs.DISC.2017.31
Christoph Lenzen and Joel Rybicki Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus 10.4230/LIPIcs.DISC.2017.32
Nancy Lynch, Cameron Musco, and Merav Parter Neuro-RAM Unit with Applications to Similarity Testing and Compression in Spiking Neural Networks 10.4230/LIPIcs.DISC.2017.33
Varun Kanade, Frederik Mallmann-Trenn, and Victor Verdugo How Large Is Your Graph? 10.4230/LIPIcs.DISC.2017.34
Hammurabi Mendes and Maurice Herlihy Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems 10.4230/LIPIcs.DISC.2017.35
Ellis Michael, Dan R. K. Ports, Naveen Kr. Sharma, and Adriana Szekeres Recovering Shared Objects Without Stable Storage 10.4230/LIPIcs.DISC.2017.36
Faisal Nawab, Joseph Izraelevitz, Terence Kelly, Charles B. Morrey III, Dhruva R. Chakrabarti, and Michael L. Scott Dalí: A Periodically Persistent Hash Map 10.4230/LIPIcs.DISC.2017.37
Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, and Peter Robinson Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets 10.4230/LIPIcs.DISC.2017.38
Rafael Pass and Elaine Shi Hybrid Consensus: Efficient Consensus in the Permissionless Model 10.4230/LIPIcs.DISC.2017.39
Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi Dynamic Reconfiguration: Abstraction and Optimal Asynchronous Solution 10.4230/LIPIcs.DISC.2017.40
Ittai Abraham, Srinivas Devadas, Kartik Nayak, and Ling Ren Brief Announcement: Practical Synchronous Byzantine Consensus 10.4230/LIPIcs.DISC.2017.41
Yehuda Afek, Yuval Emek, and Noa Kolikant Brief Announcement: The Synergy of Finite State Machines 10.4230/LIPIcs.DISC.2017.42
Lélia Blin and Sébastien Tixeuil Brief Announcement: Compact Self-Stabilizing Leader Election in Arbitrary Graphs 10.4230/LIPIcs.DISC.2017.43
Karl Bringmann and Sebastian Krinninger Brief Announcement: A Note on Hardness of Diameter Approximation 10.4230/LIPIcs.DISC.2017.44
Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, and Marcos K. Aguilera Brief Announcement: Black-Box Concurrent Data Structures for NUMA Architectures 10.4230/LIPIcs.DISC.2017.45
Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, and Pratik Sarkar Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited 10.4230/LIPIcs.DISC.2017.46
Andrea Clementi, Luciano Gualà, Francesco Pasquale, and Giacomo Scornavacca Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors 10.4230/LIPIcs.DISC.2017.47
Giuseppe A. Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, and Yukiko Yamauchi Brief Announcement: Shape Formation by Programmable Particles 10.4230/LIPIcs.DISC.2017.48
Ryota Eguchi and Taisuke Izumi Brief Announcement: Fast Aggregation in Population Protocols 10.4230/LIPIcs.DISC.2017.49
Michal Friedman, Maurice Herlihy, Virendra Marathe, and Erez Petrank Brief Announcement: A Persistent Lock-Free Queue for Non-Volatile Memory 10.4230/LIPIcs.DISC.2017.50
Matthias Függer, Thomas Nowak, and Manfred Schwarz Brief Announcement: Lower Bounds for Asymptotic Consensus in Dynamic Networks 10.4230/LIPIcs.DISC.2017.51
Vijay K. Garg Brief Announcement: Applying Predicate Detection to the Stable Marriage Problem 10.4230/LIPIcs.DISC.2017.52
Rati Gelashvili, Idit Keidar, Alexander Spiegelman, and Roger Wattenhofer Brief Announcement: Towards Reduced Instruction Sets for Synchronization 10.4230/LIPIcs.DISC.2017.53
Tomasz Jurdzínski and Krzysztof Nowicki Brief Announcement: On Connectivity in the Broadcast Congested Clique 10.4230/LIPIcs.DISC.2017.54
Janne H. Korhonen and Jukka Suomela Brief Announcement: Towards a Complexity Theory for the Congested Clique 10.4230/LIPIcs.DISC.2017.55
Petr Kuznetsov, Thibault Rieutord, and Yuan He Brief Announcement: Compact Topology of Shared-Memory Adversaries 10.4230/LIPIcs.DISC.2017.56
Christoph Lenzen and Reut Levi Brief Announcement: A Centralized Local Algorithm for the Sparse Spanning Graph Problem 10.4230/LIPIcs.DISC.2017.57
Bruna S. Peres, Olga Goussevskaia, Stefan Schmid, and Chen Avin Brief Announcement: Distributed SplayNets 10.4230/LIPIcs.DISC.2017.58
Laurent Massoulié and Rémi Varloot Brief Announcement: Rapid Mixing of Local Dynamics on Graphs 10.4230/LIPIcs.DISC.2017.59