On the complexity of global computation in the presence of link failures: the general case

DOI10.1007/BF02242713zbMath1448.68055MaRDI QIDQ5136985

Danny Hendler, Yehuda Afek

Publication date: 30 November 2020

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

lower boundsdistributed computing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Local heuristics and the emergence of spanning subgraphs in complex networks

Cites Work

• The power of multimedia: Combining point-to-point and multi-access networks
• On the complexity of computation in the presence of link failures: The case of a ring
• Distributed network protocols
• Electing a leader in a synchronous ring
• On the complexity of global computation in the presence of link failures

This page was built for publication: On the complexity of global computation in the presence of link failures: the general case