The complexity of almost-optimal simultaneous coordination

DOI10.1007/BF02523194MaRDI QIDQ675301zbMATH OpenOpenAlexFDO

Authors Rida A. Bazzi, Gil Neiger

Publication date 30 June 1997

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02523194

zbMATH Keywords

distributed computingfault-tolerant coordinationNP-hard computation

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• The possibility and the complexity of achieving fault-tolerant coordination
• Using knowledge to optimally achieve coordination in distributed systems
• scientific article; zbMATH DE number 139792
• scientific article; zbMATH DE number 2080904

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 4197453 (Why is no real title available?)
• A characterization of eventual Byzantine agreement
• Automatically increasing the fault-tolerance of distributed algorithms
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• Common knowledge and consistent simultaneous coordination
• Early stopping in Byzantine agreement
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Knowledge and common knowledge in a distributed environment
• Programming simultaneous actions using common knowledge
• Reaching Agreement in the Presence of Faults
• Simulating synchronized clocks and common knowledge in distributed systems
• The Byzantine Generals Problem
• The Distributed Firing Squad Problem
• The possibility and the complexity of achieving fault-tolerant coordination
• Using knowledge to optimally achieve coordination in distributed systems

Cited in

(3)

• The possibility and the complexity of achieving fault-tolerant coordination
• IMPERFECT COORDINATION IN OPTIMIZATION
• Coordination under limited depth of reasoning

This page was built for publication: The complexity of almost-optimal simultaneous coordination

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