Invited talk: Resilient distributed algorithms
From MaRDI portal
Publication:831782
DOI10.1007/978-3-030-67731-2_3zbMATH Open1490.68298OpenAlexW3124115049MaRDI QIDQ831782FDOQ831782
Authors: M. Parter 
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_3
Recommendations
Cites Work
- Distributed Computing: A Locality-Sensitive Approach
- Fault-tolerant broadcasting and gossiping in communication networks
- Fault-tolerant spanners
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- A minimal model for secure computation (extended abstract)
- Asynchronous consensus and broadcast protocols
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Fast Distributed Agreement
- Time is not a healer
- Replacement paths and distance sensitivity oracles via fast matrix multiplication
- Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Secure Distributed Computing Made (Nearly) Optimal
- Low Congestion Cycle Covers and Their Applications
- Distributed Algorithms Made Secure: A Graph Theoretic Approach
- On Expected Constant-Round Protocols for Byzantine Agreement
- Distributed computing in asynchronous networks with byzantine edges
- Small cuts and connectivity certificates: a fault tolerant approach
Cited In (1)
This page was built for publication: Invited talk: Resilient distributed algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831782)
