scientific article; zbMATH DE number 7561442
From MaRDI portal
Publication:5091085
DOI10.4230/LIPIcs.OPODIS.2018.14MaRDI QIDQ5091085
Nitin H. Vaidya, Lewis Tseng, Dimitris Sakavalas
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1803.04513
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Reliable communication via semilattice properties of partial knowledge
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Reliable broadcast with respect to topology knowledge
- Fault-Tolerant Consensus in Directed Graphs
- A Characterization of Dynamic Networks Where Consensus Is Solvable
- Iterative approximate byzantine consensus in arbitrary directed graphs
- Byzantine Agreement Using Partial Authentication
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
- Discovering Network Topology in the Presence of Byzantine Faults
- Reaching approximate agreement in the presence of faults
- Reaching Agreement in the Presence of Faults
- The Byzantine generals strike again
- Resilient Randomized Quantized Consensus
- Fast byzantine agreement in dynamic networks
- Reaching Approximate Byzantine Consensus with Multi-hop Communication
- Iterative Approximate Byzantine Consensus under a Generalized Fault Model
This page was built for publication:
