Distributed computing in asynchronous networks with byzantine edges

DOI10.1007/3-540-61332-3_169zbMath1529.68105MaRDI QIDQ6184680

Mordechai M. Yung, Vasant Shanbhogue

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40) Distributed algorithms (68W15) Communication complexity, information complexity (68Q11)

Related Items (1)

Invited talk: Resilient distributed algorithms

Cites Work

• Unnamed Item
• Fault-tolerant distributed algorithm for election in complete networks
• A new solution for the Byzantine generals problem
• Distributed agreement in the presence of processor and communication faults
• Impossibility of distributed consensus with one faulty process
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Tolerating linear number of faults in networks of bounded degree

This page was built for publication: Distributed computing in asynchronous networks with byzantine edges