OPODIS B

33 papers

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