LIPIcs, Volume 70, OPODIS 2016

• Panagiota Fatourou, Ernesto Jiménez, and Fernando Pedone LIPIcs, Volume 70, OPODIS'16, Complete Volume 10.4230/LIPIcs.OPODIS.2016
• Panagiota Fatourou, Ernesto Jiménez, and Fernando Pedone Front Matter, Table of Contents, Preface, Committees, List of Authors 10.4230/LIPIcs.OPODIS.2016.0
• Nir Shavit High Throughput Connectomics (Keynote Abstract) 10.4230/LIPIcs.OPODIS.2016.1
• Christian Cachin Blockchain - From the Anarchy of Cryptocurrencies to the Enterprise (Keynote Abstract) 10.4230/LIPIcs.OPODIS.2016.2
• Willy Zwaenepoel Really Big Data: Analytics on Graphs with Trillions of Edges (Keynote Abstract) 10.4230/LIPIcs.OPODIS.2016.3
• Faith Ellen Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract) 10.4230/LIPIcs.OPODIS.2016.4
• David Yu Cheng Chan, Vassos Hadzilacos, and Sam Toueg Bounded Disagreement 10.4230/LIPIcs.OPODIS.2016.5
• Eli Gafni, Yuan He, Petr Kuznetsov, and Thibault Rieutord Read-Write Memory and k-Set Consensus as an Affine Task 10.4230/LIPIcs.OPODIS.2016.6
• Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, and Petr Kuznetsov Set-Consensus Collections are Decidable 10.4230/LIPIcs.OPODIS.2016.7
• Emmanuel Godard and Eloi Perdereau k-Set Agreement in Communication Networks with Omission Faults 10.4230/LIPIcs.OPODIS.2016.8
• Sriram Pemmaraju and Talal Riaz Using Read-k Inequalities to Analyze a Distributed MIS Algorithm 10.4230/LIPIcs.OPODIS.2016.9
• Stéphane Devismes, David Ilcinkas, and Colette Johnen Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps 10.4230/LIPIcs.OPODIS.2016.10
• Johanne Cohen, Khaled Maâmra, George Manoussakis, and Laurence Pilard Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3 10.4230/LIPIcs.OPODIS.2016.11
• Pankaj Khanchandani and Roger Wattenhofer Distributed Stable Matching with Similar Preference Lists 10.4230/LIPIcs.OPODIS.2016.12
• James Aspnes, Joffroy Beauquier, Janna Burman, and Devan Sohier Time and Space Optimal Counting in Population Protocols 10.4230/LIPIcs.OPODIS.2016.13
• Leszek Gasieniec, David Hamilton, Russell Martin, Paul G. Spirakis, and Grzegorz Stachowiak Deterministic Population Protocols for Exact Majority and Plurality 10.4230/LIPIcs.OPODIS.2016.14
• Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari Design Patterns in Beeping Algorithms 10.4230/LIPIcs.OPODIS.2016.15
• Rachid Guerraoui and Alexandre Maurer Collision-Free Pattern Formation 10.4230/LIPIcs.OPODIS.2016.16
• Yen-Jung Chang and Vijay K. Garg Predicate Detection for Parallel Computations with Locking Constraints 10.4230/LIPIcs.OPODIS.2016.17
• Kim G. Larsen, Stefan Schmid, and Bingtian Xue WNetKAT: A Weighted SDN Programming and Verification Language 10.4230/LIPIcs.OPODIS.2016.18
• Mozhgan Ghasemzadeh, Hamid Arabnejad, and Jorge G. Barbosa Deadline-Budget constrained Scheduling Algorithm for Scientific Workflows in a Cloud Environment 10.4230/LIPIcs.OPODIS.2016.19
• Stavros Nikolaou and Robbert van Renesse Moving Participants Turtle Consensus 10.4230/LIPIcs.OPODIS.2016.20
• Fabien Mathieu Kleinberg’s Grid Reloaded 10.4230/LIPIcs.OPODIS.2016.21
• Annalisa De Bonis Generalized Selectors and Locally Thin Families with Applications to Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions 10.4230/LIPIcs.OPODIS.2016.22
• Aras Atalar, Paul Renaud-Goud, and Philippas Tsigas How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses 10.4230/LIPIcs.OPODIS.2016.23
• Christian Cachin, Simon Schubert, and Marko Vukolic Non-Determinism in Byzantine Fault-Tolerant Replication 10.4230/LIPIcs.OPODIS.2016.24
• Heidi Howard, Dahlia Malkhi, and Alexander Spiegelman Flexible Paxos: Quorum Intersection Revisited 10.4230/LIPIcs.OPODIS.2016.25
• Zhuolun Xiang and Nitin H. Vaidya Relaxed Byzantine Vector Consensus 10.4230/LIPIcs.OPODIS.2016.26
• Ammar Qadri m-Consensus Objects Are Pretty Powerful 10.4230/LIPIcs.OPODIS.2016.27
• Kishori M. Konwar, N. Prakash, Nancy A. Lynch, and Muriel Médard RADON: Repairable Atomic Data Object in Networks 10.4230/LIPIcs.OPODIS.2016.28
• Antonio Fernández Anta, Theophanis Hadjistasi, and Nicolas Nicolaou Computationally Light "Multi-Speed" Atomic Memory 10.4230/LIPIcs.OPODIS.2016.29
• Tiago Oliveira, Ricardo Mendes, and Alysson Bessani Exploring Key-Value Stores in Multi-Writer Byzantine-Resilient Register Emulations 10.4230/LIPIcs.OPODIS.2016.30
• Leander Jehl and Hein Meling The Case for Reconfiguration without Consensus: Comparing Algorithms for Atomic Storage 10.4230/LIPIcs.OPODIS.2016.31
• Tian Ze Chen and Yuanhao Wei Step Optimal Implementations of Large Single-Writer Registers 10.4230/LIPIcs.OPODIS.2016.32
• Alexander Spiegelman and Idit Keidar Dynamic Atomic Snapshots 10.4230/LIPIcs.OPODIS.2016.33
• Meng He and Mengdu Li Deletion without Rebalancing in Non-Blocking Binary Search Trees 10.4230/LIPIcs.OPODIS.2016.34
• Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim Proving Opacity of a Pessimistic STM 10.4230/LIPIcs.OPODIS.2016.35