default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th OPODIS 2016: Madrid, Spain
- Panagiota Fatourou, Ernesto Jiménez, Fernando Pedone:
20th International Conference on Principles of Distributed Systems, OPODIS 2016, Madrid, Spain, December 13-16, 2016. LIPIcs 70, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-031-6 - Front Matter, Table of Contents, Preface, Committees, List of Authors. 0:i-0:xviii
- Nir Shavit:
High Throughput Connectomics (Keynote Abstract). 1:1-1:1 - Christian Cachin:
Blockchain - From the Anarchy of Cryptocurrencies to the Enterprise (Keynote Abstract). 2:1-2:1 - Willy Zwaenepoel:
Really Big Data: Analytics on Graphs with Trillions of Edges (Keynote Abstract). 3:1-3:1 - Faith Ellen:
Participating Sets, Simulations, and the Consensus Hierarchy (Keynote Abstract). 4:1-4:1 - David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg:
Bounded Disagreement. 5:1-5:16 - Eli Gafni, Yuan He, Petr Kuznetsov, Thibault Rieutord:
Read-Write Memory and k-Set Consensus as an Affine Task. 6:1-6:17 - Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Petr Kuznetsov:
Set-Consensus Collections are Decidable. 7:1-7:15 - Emmanuel Godard, Eloi Perdereau:
k-Set Agreement in Communication Networks with Omission Faults. 8:1-8:17 - Sriram V. Pemmaraju, Talal Riaz:
Using Read-k Inequalities to Analyze a Distributed MIS Algorithm. 9:1-9:17 - Stéphane Devismes
, David Ilcinkas, Colette Johnen:
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. 10:1-10:16 - Johanne Cohen, Khaled Maamra, George Manoussakis, Laurence Pilard:
Polynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3. 11:1-11:17 - Pankaj Khanchandani, Roger Wattenhofer:
Distributed Stable Matching with Similar Preference Lists. 12:1-12:16 - James Aspnes, Joffroy Beauquier, Janna Burman, Devan Sohier:
Time and Space Optimal Counting in Population Protocols. 13:1-13:17 - Leszek Gasieniec, David D. Hamilton, Russell Martin, Paul G. Spirakis, Grzegorz Stachowiak:
Deterministic Population Protocols for Exact Majority and Plurality. 14:1-14:14 - Arnaud Casteigts, Yves Métivier, John Michael Robson, Akka Zemmari:
Design Patterns in Beeping Algorithms. 15:1-15:16 - Rachid Guerraoui, Alexandre Maurer:
Collision-Free Pattern Formation. 16:1-16:13 - Yen-Jung Chang, Vijay K. Garg:
Predicate Detection for Parallel Computations with Locking Constraints. 17:1-17:17 - Kim G. Larsen, Stefan Schmid, Bingtian Xue:
WNetKAT: A Weighted SDN Programming and Verification Language. 18:1-18:18 - Mozhgan Ghasemzadeh, Hamid Arabnejad, Jorge G. Barbosa:
Deadline-Budget constrained Scheduling Algorithm for Scientific Workflows in a Cloud Environment. 19:1-19:16 - Stavros Nikolaou, Robbert van Renesse:
Moving Participants Turtle Consensus. 20:1-20:17 - Fabien Mathieu:
Kleinberg's Grid Reloaded. 21:1-21:15 - Annalisa De Bonis:
Generalized Selectors and Locally Thin Families with Applications to Conflict Resolution in Multiple Access Channels Supporting Simultaneous Successful Transmissions. 22:1-22:16 - Aras Atalar, Paul Renaud-Goud, Philippas Tsigas:
How Lock-free Data Structures Perform in Dynamic Environments: Models and Analyses. 23:1-23:17 - Christian Cachin, Simon Schubert, Marko Vukolic:
Non-Determinism in Byzantine Fault-Tolerant Replication. 24:1-24:16 - Heidi Howard, Dahlia Malkhi, Alexander Spiegelman:
Flexible Paxos: Quorum Intersection Revisited. 25:1-25:14 - Zhuolun Xiang, Nitin H. Vaidya:
Relaxed Byzantine Vector Consensus. 26:1-26:15 - Ammar Qadri:
m-Consensus Objects Are Pretty Powerful. 27:1-27:14 - Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
RADON: Repairable Atomic Data Object in Networks. 28:1-28:17 - Antonio Fernández Anta, Theophanis Hadjistasi, Nicolas C. Nicolaou:
Computationally Light "Multi-Speed" Atomic Memory. 29:1-29:17 - Tiago Oliveira, Ricardo Mendes, Alysson Neves Bessani:
Exploring Key-Value Stores in Multi-Writer Byzantine-Resilient Register Emulations. 30:1-30:17 - Leander Jehl, Hein Meling:
The Case for Reconfiguration without Consensus: Comparing Algorithms for Atomic Storage. 31:1-31:17 - Tian Ze Chen, Yuanhao Wei:
Step Optimal Implementations of Large Single-Writer Registers. 32:1-32:16 - Alexander Spiegelman, Idit Keidar:
Dynamic Atomic Snapshots. 33:1-33:16 - Meng He, Mengdu Li:
Deletion without Rebalancing in Non-Blocking Binary Search Trees. 34:1-34:17 - Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, Heike Wehrheim:
Proving Opacity of a Pessimistic STM. 35:1-35:17
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 2026-07-28 23:26 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
