Invited talk: Resilient distributed algorithms

DOI10.1007/978-3-030-67731-2_3zbMath1490.68298MaRDI QIDQ831782

Merav Parter

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_3

zbMATH Keywords

secure computation; CONGEST; resilient computation

Mathematics Subject Classification ID

68W15: Distributed algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• A minimal model for secure computation (extended abstract)
• Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
• Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity
• Fault-tolerant spanners
• Asynchronous consensus and broadcast protocols
• Fast Distributed Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Distributed Computing: A Locality-Sensitive Approach
• Time is not a healer
• Secure Distributed Computing Made (Nearly) Optimal
• Low Congestion Cycle Covers and Their Applications
• Distributed Algorithms Made Secure: A Graph Theoretic Approach
• Fault-tolerant broadcasting and gossiping in communication networks
• On Expected Constant-Round Protocols for Byzantine Agreement
• Distributed computing in asynchronous networks with byzantine edges