LIPIcs, Volume 46, OPODIS 2015

• Emmanuelle Anceaume, Christian Cachin, and Maria Potop-Butucaru LIPIcs, Volume 46, OPODIS'15, Complete Volume 10.4230/LIPIcs.OPODIS.2015
• Emmanuelle Anceaume, Christian Cachin, and Maria Potop-Butucaru Front Matter, Table of Contents, Preface, Committees, List of Authors 10.4230/LIPIcs.OPODIS.2015.0
• Michel Raynal Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial) 10.4230/LIPIcs.OPODIS.2015.1
• Alexander Spiegelman, Idit Keidar, and Dahlia Malkhi Dynamic Reconfiguration: A Tutorial (Tutorial) 10.4230/LIPIcs.OPODIS.2015.2
• Nicola Santoro Time to Change: On Distributed Computing in Dynamic Networks (Keynote) 10.4230/LIPIcs.OPODIS.2015.3
• Alexander Spiegelman, Yuval Cassuto, Gregory Chockler, and Idit Keidar Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote) 10.4230/LIPIcs.OPODIS.2015.4
• Juan A. Garay Blockchain-Based Consensus (Keynote) 10.4230/LIPIcs.OPODIS.2015.5
• Stephan Holzer and Nathan Pinsker Approximation of Distances and Shortest Paths in the Broadcast Congest Clique 10.4230/LIPIcs.OPODIS.2015.6
• Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, and Anisur Rahaman Molla The Cost of Global Broadcast in Dynamic Radio Networks 10.4230/LIPIcs.OPODIS.2015.7
• Seth Gilbert, Calvin Newport, and Tonghe Wang Bounds for Blind Rate Adaptation 10.4230/LIPIcs.OPODIS.2015.8
• Tobias Langner, Barbara Keller, Jara Uitto, and Roger Wattenhofer Overcoming Obstacles with Ants 10.4230/LIPIcs.OPODIS.2015.9
• Fabian Kuhn and Anisur Rahaman Molla Distributed Sparse Cut Approximation 10.4230/LIPIcs.OPODIS.2015.10
• Magnús M. Halldórsson, Sven Köhler, and Dror Rawitz Distributed Approximation of k-Service Assignment 10.4230/LIPIcs.OPODIS.2015.11
• Claire Capdevielle, Colette Johnen, Petr Kuznetsov, and Alessia Milani On the Uncontended Complexity of Anonymous Consensus 10.4230/LIPIcs.OPODIS.2015.12
• Vikram Saraph and Maurice Herlihy The Relative Power of Composite Loop Agreement Tasks 10.4230/LIPIcs.OPODIS.2015.13
• Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, and Toshimitsu Masuzawa Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers 10.4230/LIPIcs.OPODIS.2015.14
• Orr Tamir, Adam Morrison, and Noam Rinetzky A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms 10.4230/LIPIcs.OPODIS.2015.15
• Ajoy K. Datta, Lawrence L. Larmore, and Toshimitsu Masuzawa Maximum Matching for Anonymous Trees with Constant Space per Process 10.4230/LIPIcs.OPODIS.2015.16
• Leqi Zhu and Faith Ellen Atomic Snapshots from Small Registers 10.4230/LIPIcs.OPODIS.2015.17
• Zohir Bouzid, Michel Raynal, and Pierre Sutra Anonymous Obstruction-Free (n,k)-Set Agreement with n-k+1 Atomic Read/Write Registers 10.4230/LIPIcs.OPODIS.2015.18
• Antonio Fernández Anta, Nicolas Nicolaou, and Alexandru Popa Making "Fast" Atomic Operations Computationally Tractable 10.4230/LIPIcs.OPODIS.2015.19
• Ryan Berryhill, Wojciech Golab, and Mahesh Tripunitara Robust Shared Objects for Non-Volatile Main Memory 10.4230/LIPIcs.OPODIS.2015.20
• Joffroy Beauquier, Peva Blanchard, Janna Burman, and Rachid Guerraoui The Benefits of Entropy in Population Protocols 10.4230/LIPIcs.OPODIS.2015.21
• David Stolz and Roger Wattenhofer Byzantine Agreement with Median Validity 10.4230/LIPIcs.OPODIS.2015.22
• Jingshu Chen, Mohammad Roohitavaf, and Sandeep S. Kulkarni Ensuring Average Recovery with Adversarial Scheduler 10.4230/LIPIcs.OPODIS.2015.23
• Christian Scheideler, Alexander Setzer, and Thim Strothmann Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures 10.4230/LIPIcs.OPODIS.2015.24
• Yen-Jung Chang and Vijay K. Garg QuickLex: A Fast Algorithm for Consistent Global States Enumeration of Distributed Computations 10.4230/LIPIcs.OPODIS.2015.25
• Damien Imbs The Synchronization Power of Atomic Bitwise Operations 10.4230/LIPIcs.OPODIS.2015.26
• Nikolaos D. Kallimanis and Eleni Kanellou Wait-Free Concurrent Graph Objects with Dynamic Traversals 10.4230/LIPIcs.OPODIS.2015.27
• Alessia Milani and Miguel A. Mosteiro A Faster Counting Protocol for Anonymous Dynamic Networks 10.4230/LIPIcs.OPODIS.2015.28
• Wei-Lun Hung, Himanshu Chauhan, and Vijay K. Garg ActiveMonitor: Asynchronous Monitor Framework for Scalability and Multi-Object Synchronization 10.4230/LIPIcs.OPODIS.2015.29
• Artur Czumaj and Peter Davies Communicating with Beeps 10.4230/LIPIcs.OPODIS.2015.30
• Hagit Attiya, Armando Castaneda, and Danny Hendler Nontrivial and Universal Helping for Wait-Free Queues and Stacks 10.4230/LIPIcs.OPODIS.2015.31
• Edward Talmage and Jennifer Welch Generic Proofs of Consensus Numbers for Abstract Data Types 10.4230/LIPIcs.OPODIS.2015.32
• Giuseppe Di Luna and Roberto Baldoni Non Trivial Computations in Anonymous Dynamic Networks 10.4230/LIPIcs.OPODIS.2015.33
• Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, and Murat Demirbas Analysis of Bounds on Hybrid Vector Clocks 10.4230/LIPIcs.OPODIS.2015.34
• Niloufar Shafiei Non-Blocking Doubly-Linked Lists with Good Amortized Complexity 10.4230/LIPIcs.OPODIS.2015.35
• Hagit Attiya and Arie Fouren Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives 10.4230/LIPIcs.OPODIS.2015.36