default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th OPODIS 2015: Rennes, France
- Emmanuelle Anceaume, Christian Cachin, Maria Gradinariu Potop-Butucaru:
19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France. LIPIcs 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-939897-98-9 - Front Matter, Table of Contents, Preface, Committees, List of Authors. 0:i-0:xvi
- Michel Raynal:
Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial). 1:1-1:10 - Alexander Spiegelman, Idit Keidar, Dahlia Malkhi:
Dynamic Reconfiguration: A Tutorial (Tutorial). 2:1-2:14 - Nicola Santoro:
Time to Change: On Distributed Computing in Dynamic Networks (Keynote). 3:1-3:14 - Alexander Spiegelman, Yuval Cassuto, Gregory V. Chockler
, Idit Keidar:
Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote). 4:1-4:3 - Juan A. Garay:
Blockchain-Based Consensus (Keynote). 5:1-5:1 - Stephan Holzer, Nathan Pinsker:
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. 6:1-6:16 - Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla:
The Cost of Global Broadcast in Dynamic Radio Networks. 7:1-7:17 - Seth Gilbert, Calvin C. Newport, Tonghe Wang:
Bounds for Blind Rate Adaptation. 8:1-8:17 - Tobias Langner, Barbara Keller, Jara Uitto, Roger Wattenhofer:
Overcoming Obstacles with Ants. 9:1-9:17 - Fabian Kuhn, Anisur Rahaman Molla:
Distributed Sparse Cut Approximation. 10:1-10:14 - Magnús M. Halldórsson, Sven Köhler, Dror Rawitz:
Distributed Approximation of k-Service Assignment. 11:1-11:16 - Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani:
On the Uncontended Complexity of Anonymous Consensus. 12:1-12:16 - Vikram Saraph, Maurice Herlihy:
The Relative Power of Composite Loop Agreement Tasks. 13:1-13:16 - Yuichi Sudo, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa:
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers. 14:1-14:16 - Orr Tamir, Adam Morrison, Noam Rinetzky:
A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms. 15:1-15:16 - Ajoy Kumar Datta, Lawrence L. Larmore, Toshimitsu Masuzawa:
Maximum Matching for Anonymous Trees with Constant Space per Process. 16:1-16:16 - Leqi Zhu, Faith Ellen:
Atomic Snapshots from Small Registers. 17:1-17:16 - Zohir Bouzid, Michel Raynal, Pierre Sutra:
Anonymous Obstruction-Free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers. 18:1-18:17 - Antonio Fernández Anta, Nicolas C. Nicolaou, Alexandru Popa:
Making "Fast" Atomic Operations Computationally Tractable. 19:1-19:16 - Ryan Berryhill, Wojciech M. Golab, Mahesh Tripunitara:
Robust Shared Objects for Non-Volatile Main Memory. 20:1-20:17 - Joffroy Beauquier, Peva Blanchard, Janna Burman, Rachid Guerraoui:
The Benefits of Entropy in Population Protocols. 21:1-21:15 - David Stolz, Roger Wattenhofer:
Byzantine Agreement with Median Validity. 22:1-22:14 - Jingshu Chen, Mohammad Roohitavaf, Sandeep S. Kulkarni:
Ensuring Average Recovery with Adversarial Scheduler. 23:1-23:18 - Christian Scheideler, Alexander Setzer, Thim Strothmann:
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. 24:1-24:17 - Yen-Jung Chang, Vijay K. Garg:
QuickLex: A Fast Algorithm for Consistent Global States Enumeration of Distributed Computations. 25:1-25:17 - Damien Imbs:
The Synchronization Power of Atomic Bitwise Operations. 26:1-26:17 - Nikolaos D. Kallimanis, Eleni Kanellou:
Wait-Free Concurrent Graph Objects with Dynamic Traversals. 27:1-27:17 - Alessia Milani, Miguel A. Mosteiro:
A Faster Counting Protocol for Anonymous Dynamic Networks. 28:1-28:13 - Wei-Lun Hung, Himanshu Chauhan, Vijay K. Garg:
ActiveMonitor: Asynchronous Monitor Framework for Scalability and Multi-Object Synchronization. 29:1-29:17 - Artur Czumaj, Peter Davies:
Communicating with Beeps. 30:1-30:16 - Hagit Attiya, Armando Castañeda, Danny Hendler:
Nontrivial and Universal Helping for Wait-Free Queues and Stacks. 31:1-31:16 - Edward Talmage, Jennifer L. Welch:
Generic Proofs of Consensus Numbers for Abstract Data Types. 32:1-32:16 - Giuseppe Antonio Di Luna, Roberto Baldoni:
Non Trivial Computations in Anonymous Dynamic Networks. 33:1-33:16 - Sorrachai Yingchareonthawornchai, Sandeep S. Kulkarni, Murat Demirbas:
Analysis of Bounds on Hybrid Vector Clocks. 34:1-34:17 - Niloufar Shafiei:
Non-Blocking Doubly-Linked Lists with Good Amortized Complexity. 35:1-35:17 - Hagit Attiya, Arie Fouren:
Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives. 36:1-36:16
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-13 00:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
