default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID25th OPODIS 2021: Strasbourg, France
- Quentin Bramas
, Vincent Gramoli, Alessia Milani:
25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France. LIPIcs 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-219-8 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Nathalie Bertrand:
Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk). 1:1-1:1 - Petr Kuznetsov:
Accountable Distributed Computing (Invited Talk). 2:1-2:1 - Robbert van Renesse:
A Fresh Look at the Design and Implementation of Communication Paradigms (Invited Talk). 3:1-3:1 - Alexandre Maurer:
Arbitrarily Accurate Aggregation Scheme for Byzantine SGD. 4:1-4:17 - Ittai Abraham, Ling Ren, Zhuolun Xiang:
Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization. 5:1-5:20 - Emmanuelle Anceaume, Antonella Del Pozzo, Thibault Rieutord, Sara Tucci Piergiovanni:
On Finality in Blockchains. 6:1-6:19 - Shehar Bano, Alberto Sonnino, Andrey Chursin, Dmitri Perelman, Zekun Li, Avery Ching, Dahlia Malkhi:
Twins: BFT Systems Made Robust. 7:1-7:29 - Ajay D. Kshemkalyani, Gokarna Sharma:
Near-Optimal Dispersion on Arbitrary Anonymous Graphs. 8:1-8:19 - Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada:
Asynchronous Gathering in a Torus. 9:1-9:17 - Kaustav Bose, Archak Das, Buddhadeb Sau:
Pattern Formation by Robots with Inaccurate Movements. 10:1-10:20 - Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, Martijn Struijs:
Near-Shortest Path Routing in Hybrid Communication Networks. 11:1-11:23 - Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas:
Efficient Assignment of Identities in Anonymous Populations. 12:1-12:21 - Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue:
Population Protocols for Graph Class Identification Problems. 13:1-13:19 - Dan Alistarh, Rati Gelashvili, Joel Rybicki:
Fast Graphical Population Protocols. 14:1-14:18 - Amir Nikabadi, Janne H. Korhonen:
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters. 15:1-15:18 - Sebastian Forster, Martin Grösbacher, Tijn de Vos:
An Improved Random Shift Algorithm for Spanners and Low Diameter Decompositions. 16:1-16:17 - Salwa Faour, Marc Fuchs, Fabian Kuhn:
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings. 17:1-17:20 - Alkida Balliu, Fabian Kuhn, Dennis Olivetti:
Improved Distributed Fractional Coloring Algorithms. 18:1-18:23 - Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich, Mikaël Rabie:
Distributed Recoloring of Interval and Chordal Graphs. 19:1-19:17 - Bapi Chatterjee, Sathya Peri, Muktikanta Sa, Komma Manogna:
Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds. 20:1-20:25 - Orr Fischer, Rotem Oshman, Dana Shamir:
Explicit Space-Time Tradeoffs for Proof Labeling Schemes in Graphs with Small Separators. 21:1-21:22 - Nicolas Bousquet, Laurent Feuilloley, Théo Pierron:
Local Certification of Graph Decompositions and Applications to Minor-Free Classes. 22:1-22:17 - Luciano Freitas de Souza, Andrei Tonkikh, Sara Tucci Piergiovanni, Renaud Sirdey, Oana Stan, Nicolas Quero, Petr Kuznetsov:
RandSolomon: Optimally Resilient Random Number Generator with Deterministic Termination. 23:1-23:16 - Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder:
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms. 24:1-24:12 - Luciano Freitas de Souza, Petr Kuznetsov, Thibault Rieutord, Sara Tucci Piergiovanni:
Accountability and Reconfiguration: Self-Healing Lattice Agreement. 25:1-25:23 - William Schultz, Siyuan Zhou, Ian Dardik, Stavros Tripakis:
Design and Analysis of a Logless Dynamic Reconfiguration Protocol. 26:1-26:16 - Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Optimal Good-Case Latency for Rotating Leader Synchronous BFT. 27:1-27:19 - Steven Munsu Hwang, Philipp Woelfel:
Strongly Linearizable Linked List and Queue. 28:1-28:20 - Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Recoverable and Detectable Fetch&Add. 29:1-29:17 - Gal Assa, Hagar Meir, Guy Golan-Gueta, Idit Keidar, Alexander Spiegelman:
Using Nesting to Push the Limits of Transactional Data Structure Libraries. 30:1-30:17 - Bernard Mans, Ali Pourmiri:
Asynchronous Rumor Spreading in Dynamic Graphs. 31:1-31: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-02-19 00:51 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:
