scientific article; zbMATH DE number 139792

MaRDI QIDQ4028117zbMATH OpenFDO

Authors Ofer Biran, Shlomo Moran, Shmuel Zaks

Publication date 28 March 1993

zbMATH Keywords

distributed tasksfault-tolerant distributed systemsfaulty processorNP-hardprotocols

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1559574
• A combinatorial characterization of the distributed 1-solvable tasks
• The computational complexity of the reliability problem on distributed systems
• Solvability in Asynchronous Environments II: Finite Interactive Tasks
• Asynchronous computability theorems for \(t\)-resilient systems

Cited in

(5)

• A combinatorial characterization of the distributed 1-solvable tasks
• scientific article; zbMATH DE number 1559574 (Why is no real title available?)
• Hundreds of impossibility results for distributed computing
• Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
• The complexity of almost-optimal simultaneous coordination

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028117)