Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th OPODIS 2020: Strasbourg, France (Virtual Conference)
- Quentin Bramas
, Rotem Oshman, Paolo Romano:
24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference). LIPIcs 184, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-176-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Pascal Felber:
Big Data Processing: Security and Scalability Challenges (Invited Talk). 1:1-1:1 - Idit Keidar:
Byzantine Agreement and SMR with Sub-Quadratic Message Complexity (Invited Talk). 2:1-2:1 - Jukka Suomela:
Can We Automate Our Own Work - or Show That It Is Hard? (Invited Talk). 3:1-3:1 - Xiong Zheng, Vijay K. Garg:
Byzantine Lattice Agreement in Asynchronous Systems. 4:1-4:16 - Isaac C. Sheff, Xinwen Wang, Robbert van Renesse, Andrew C. Myers:
Heterogeneous Paxos. 5:1-5:17 - Martin Hirt, Ard Kastrati, Chen-Da Liu-Zhang:
Multi-Threshold Asynchronous Reliable Broadcast and Consensus. 6:1-6:16 - Qinzi Zhang, Lewis Tseng:
Echo-CGC: A Communication-Efficient Byzantine-Tolerant Distributed Machine Learning Algorithm in Single-Hop Radio Network. 7:1-7:16 - Amine Boussetta, El-Mahdi El-Mhamdi, Rachid Guerraoui, Alexandre Maurer, Sébastien Rouault:
AKSEL: Fast Byzantine SGD. 8:1-8:16 - Alexander Spiegelman, Arik Rinberg, Dahlia Malkhi:
ACE: Abstract Consensus Encapsulation for Liveness Boosting of State Machine Replication. 9:1-9:18 - Ignacio Amores-Sesar, Christian Cachin, Jovana Micic:
Security Analysis of Ripple Consensus. 10:1-10:16 - Ittai Abraham, Gilad Stern:
Information Theoretic HotStuff. 11:1-11:16 - Yackolley Amoussou-Guenou, Bruno Biais, Maria Potop-Butucaru, Sara Tucci Piergiovanni:
Rational Behaviors in Committee-Based Blockchains. 12:1-12:16 - Armando Castañeda, Sergio Rajsbaum, Michel Raynal:
Relaxed Queues and Stacks from Read/Write Operations. 13:1-13:19 - Dempsey Wade, Edward Talmage:
Fast and Space-Efficient Queues via Relaxation. 14:1-14:16 - Daniel Katzan, Adam Morrison:
Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. 15:1-15:16 - Hagit Attiya, Sweta Kumari, Noa Schiller:
Optimal Resilience in Systems That Mix Shared Memory and Message Passing. 16:1-16:16 - Soukaina Firmli, Vasileios Trigonakis, Jean-Pierre Lozi, Iraklis Psaroudakis, Alexander Weld, Dalila Chiadmi, Sungpack Hong, Hassan Chafi:
CSR++: A Fast, Scalable, Update-Friendly Graph Data Structure. 17:1-17:16 - Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally Solvable Tasks and the Limitations of Valency Arguments. 18:1-18:16 - Talley Amir, James Aspnes, John Lazarsfeld:
Approximate Majority with Catalytic Inputs. 19:1-19:16 - Ritam Ganguly, Anik Momtaz, Borzoo Bonakdarpour:
Distributed Runtime Verification Under Partial Synchrony. 20:1-20:17 - Mahboubeh Samadi, Fatemeh Ghassemi, Ramtin Khosravi:
Decentralized Runtime Enforcement of Message Sequences in Message-Based Systems. 21:1-21:18 - Haimin Chen, Chaodong Zheng:
Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks. 22:1-22:16 - Rachid Guerraoui, Jovan Komatovic, Petr Kuznetsov, Yvonne-Anne Pignolet, Dragos-Adrian Seredinschi, Andrei Tonkikh:
Dynamic Byzantine Reliable Broadcast. 23:1-23:18 - Shantanu Das, Nikos Giachoudis, Flaminia L. Luccio, Euripides Markou:
Broadcasting with Mobile Agents in Dynamic Networks. 24:1-24:16 - Chen-Da Liu-Zhang, Varun Maram, Ueli Maurer:
On Broadcast in Generalized Network and Adversarial Models. 25:1-25:16 - Mahmoud Parham, Klaus-Tycho Foerster, Petar Kosic, Stefan Schmid:
Maximally Resilient Replacement Paths for a Family of Product Graphs. 26:1-26:16 - Alexandre Maurer:
Self-Stabilizing Byzantine-Resilient Communication in Dynamic Networks. 27:1-27:11 - Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman:
Fast Deterministic Algorithms for Highly-Dynamic Networks. 28:1-28:16 - Salwa Faour, Fabian Kuhn:
Approximating Bipartite Minimum Vertex Cover in the CONGEST Model. 29:1-29:16 - Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, Virginia Vassilevska Williams:
Distributed Distance Approximation. 30:1-30:17 - Michael Feldmann, Kristian Hinnenthal, Christian Scheideler:
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. 31:1-31:16 - Leonid Barenboim, Harel Levin:
Secured Distributed Algorithms Without Hardness Assumptions. 32:1-32:16 - Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue, Sébastien Tixeuil:
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs. 33:1-33:16
a service of 
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 2024-06-29 00:48 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
