default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st OPODIS 2017: Lisbon, Portugal
- James Aspnes, Alysson Bessani, Pascal Felber, João Leitão:
21st International Conference on Principles of Distributed Systems, OPODIS 2017, Lisbon, Portugal, December 18-20, 2017. LIPIcs 95, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-061-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xx
- Luís E. T. Rodrigues:
Causality for the Masses: Offering Fresh Data, Low Latency, and High Throughput. 1:1-1:1 - Conrad Burchert, Roger Wattenhofer:
piChain: When a Blockchain meets Paxos. 2:1-2:13 - Fabian Kuhn, Philipp Schneider
:
Broadcasting in an Unreliable SINR Model. 3:1-3:21 - Janne H. Korhonen, Joel Rybicki:
Deterministic Subgraph Detection in Broadcast CONGEST. 4:1-4:16 - Michael Dinitz, Yasamin Nazari:
Distributed Distance-Bounded Network Design Through Distributed Convex Programming. 5:1-5:19 - Tzlil Gonen, Rotem Oshman:
Lower Bounds for Subgraph Detection in the CONGEST Model. 6:1-6:16 - Tingzhe Zhou, Victor Luchangco, Michael F. Spear:
Extending Transactional Memory with Atomic Deferral. 7:1-7:17 - Panagiota Fatourou, Nikolaos D. Kallimanis:
Lock Oscillation: Boosting the Performance of Concurrent Data Structures. 8:1-8:17 - Damien Imbs, Petr Kuznetsov, Thibault Rieutord:
Progress-Space Tradeoffs in Single-Writer Memory Implementations. 9:1-9:17 - Nachshon Cohen, Maurice Herlihy, Erez Petrank, Elias Wald:
The Teleportation Design Pattern for Hardware Transactional Memory. 10:1-10:16 - Huda Chuangpishit, Saeed Mehrabi, Lata Narayanan, Jaroslav Opatrny:
Evacuating an Equilateral Triangle in the Face-to-Face Model. 11:1-11:16 - Ha Thi Thu Doan, François Bonnet, Kazuhiro Ogata:
Model Checking of Robot Gathering. 12:1-12:16 - Yusaku Tomita, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
Plane Formation by Synchronous Mobile Robots without Chirality. 13:1-13:17 - Stefan Dobrev, Rastislav Královic, Dana Pardubská:
Treasure Hunt with Barely Communicating Agents. 14:1-14:16 - Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo:
Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms. 15:1-15:17 - Hagit Attiya, Arie Fouren:
Lower Bounds on the Amortized Time Complexity of Shared Objects. 16:1-16:18 - Rotem Dvir, Gadi Taubenfeld:
Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code. 17:1-17:16 - Hagit Attiya, Gili Yavneh:
Remote Memory References at Block Granularity. 18:1-18:17 - Hiroto Yasumi, Fukuhito Ooshita, Ken-ichi Yamaguchi, Michiko Inoue:
Constant-Space Population Protocols for Uniform Bipartition. 19:1-19:17 - Himanshu Chauhan, Vijay K. Garg:
Fast Detection of Stable and Count Predicates in Parallel Computations. 20:1-20:21 - Keren Censor-Hillel, Michal Dory:
Fast Distributed Approximation for TAP and 2-Edge-Connectivity. 21:1-21:20 - Susumu Nishimura:
Schlegel Diagram and Optimizable Immediate Snapshot Protocol. 22:1-22:16 - Tim Jungnickel, Lennart Oldenburg, Matthias Loibl:
Designing a Planetary-Scale IMAP Service with Conflict-free Replicated Data Types. 23:1-23:17 - Gonçalo Cabrita, Nuno M. Preguiça:
Non-Uniform Replication. 24:1-24:19 - Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, Alexander Spiegelman:
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. 25:1-25:19 - Eduardo Alchieri, Alysson Bessani, Fabíola Greve, Joni da Silva Fraga:
Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant Storage. 26:1-26:17 - Roy Friedman, Roni Licher:
Hardening Cassandra Against Byzantine Failures. 27:1-27:20 - André Joaquim, Miguel L. Pardal, Miguel Correia:
Vulnerability-Tolerant Transport Layer Security. 28:1-28:16 - Adam Shimi, Aurélie Hurault, Philippe Quéinnec:
Asynchronous Message Orderings Beyond Causality. 29:1-29:20 - Tuomo Lempiäinen, Jukka Suomela:
Constant Space and Non-Constant Time in Distributed Computing. 30:1-30:16 - Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Yukiko Yamauchi:
Shape Formation by Programmable Particles. 31:1-31:16 - Marijana Lazic, Igor Konnov, Josef Widder, Roderick Bloem:
Synthesis of Distributed Algorithms with Parameterized Threshold Guards. 32:1-32:20
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-11-07 00:40 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:
