default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID23rd OPODIS 2019: Neuchâtel, Switzerland
- Pascal Felber, Roy Friedman, Seth Gilbert, Avery Miller:
23rd International Conference on Principles of Distributed Systems, OPODIS 2019, Neuchâtel, Switzerland, December 17-19, 2019. LIPIcs 153, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-133-7 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:22
- Rachid Guerraoui
:
Demystifying Bitcoin (Keynote Abstract). 1:1-1:1 - Keren Censor-Hillel:
Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract). 2:1-2:1 - Haris Pozidis:
Snap ML - Accelerated Machine Learning for Big Data (Keynote Abstract). 3:1-3:1 - Kfir Lev-Ari, Alexander Spiegelman, Idit Keidar, Dahlia Malkhi:
FairLedger: A Fair Blockchain Protocol for Financial Institutions. 4:1-4:17 - Álvaro García-Pérez, Maria Anna Schett:
Deconstructing Stellar Consensus. 5:1-5:16 - Alex Auvolat, Michel Raynal, François Taïani:
Byzantine-Tolerant Set-Constrained Delivery Broadcast. 6:1-6:23 - Christian Cachin, Björn Tackmann:
Asymmetric Distributed Trust. 7:1-7:16 - Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Uniform Partition in Population Protocol Model Under Weak Fairness. 8:1-8:16 - Genc Tato, Marin Bertier, Etienne Rivière, Cédric Tedeschi:
Split and Migrate: Resource-Driven Placement and Discovery of Microservices at the Edge. 9:1-9:16 - Zhanhao Chen, Ahmed Hassan, Masoomeh Javidi Kishi, Jacob Nelson, Roberto Palmieri:
HaTS: Hardware-Assisted Transaction Scheduler. 10:1-10:16 - Nuno Machado, Francisco Maia, Francisco Neves, Fábio Coelho, José Pereira:
Minha: Large-Scale Distributed Systems Testing Made Practical. 11:1-11:17 - Kishori M. Konwar, N. Prakash, Muriel Médard, Nancy A. Lynch:
Fast Lean Erasure-Coded Atomic Memory Object. 12:1-12:17 - Ran Gelles, Siddharth Iyer:
Interactive Coding Resilient to an Unknown Number of Erasures. 13:1-13:16 - Weihai Yu, Victorien Elvinger, Claudia-Lavinia Ignat:
A Generic Undo Support for State-Based CRDTs. 14:1-14:17 - Dan Alistarh, Alexander Fedorov, Nikita Koval:
In Search of the Fastest Concurrent Union-Find Algorithm. 15:1-15:16 - Felipe de Azevedo Piovezan, Vassos Hadzilacos, Sam Toueg:
On Deterministic Linearizable Set Agreement Objects. 16:1-16:15 - Kyrill Winkler, Ulrich Schmid, Yoram Moses:
A Characterization of Consensus Solvability for Closed Message Adversaries. 17:1-17:16 - Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou:
An Efficient Universal Construction for Large Objects. 18:1-18:15 - Diego Cepeda, Sakib Chowdhury, Nan Li, Raphael Lopez, Xinzhe Wang, Wojciech M. Golab:
Toward Linearizability Testing for Multi-Word Persistent Synchronization Primitives. 19:1-19:17 - Itay Harel, Amit Jacob Fanani, Moshe Sulamy, Yehuda Afek:
Consensus in Equilibrium: Can One Against All Decide Fairly? 20:1-20:17 - Laura Schmid, Krishnendu Chatterjee, Stefan Schmid:
The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game. 21:1-21:16 - Tsuyoshi Gotoh, Paola Flocchini, Toshimitsu Masuzawa, Nicola Santoro:
Tight Bounds on Distributed Exploration of Temporal Graphs. 22:1-22:16 - Xiong Zheng, Vijay K. Garg:
Parallel and Distributed Algorithms for the Housing Allocation Problem. 23:1-23:16 - Shantanu Das, Giuseppe Antonio Di Luna, Paola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita:
Oblivious Permutations on the Plane. 24:1-24:16 - Paola Flocchini, Nicola Santoro, Koichi Wada:
On Memory, Communication, and Synchronous Schedulers When Moving and Computing. 25:1-25:17 - Sumi Acharjee, Konstantinos Georgiou, Somnath Kundu, Akshaya Srinivasan:
Lower Bounds for Shoreline Searching With 2 or More Robots. 26:1-26:11 - Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Gathering on Rings for Myopic Asynchronous Robots With Lights. 27:1-27:17 - Vassos Hadzilacos, Xing Hu, Sam Toueg:
Optimal Register Construction in M&M Systems. 28:1-28:16 - Xiong Zheng, Vijay K. Garg, John Kaippallimalil:
Linearizable Replicated State Machines With Lattice Agreement. 29:1-29:16 - Muhammad Samir Khan, Lewis Tseng, Nitin H. Vaidya:
Exact Byzantine Consensus on Arbitrary Directed Graphs Under Local Broadcast Model. 30:1-30:16 - Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Reconfigurable Lattice Agreement and Applications. 31:1-31:17 - Yuval Emek, Noga Harlev, Taisuke Izumi:
Towards Distributed Two-Stage Stochastic Optimization. 32:1-32:16 - Danupon Nanongkai, Michele Scquizzato:
Equivalence Classes and Conditional Hardness in Massively Parallel Computations. 33:1-33:16 - Yasamin Nazari:
Sparse Hopsets in Congested Clique. 34:1-34:16 - Michael Dinitz, Yasamin Nazari:
Massively Parallel Approximate Distance Sketches. 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 2025-11-28 23:52 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:
