The complexity of almost-optimal simultaneous coordination

DOI10.1007/BF02523194zbMath0865.68009OpenAlexW1978122029MaRDI QIDQ675301

Gil Neiger, Rida A. Bazzi

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Programming simultaneous actions using common knowledge
• Using knowledge to optimally achieve coordination in distributed systems
• Common knowledge and consistent simultaneous coordination
• A Characterization of Eventual Byzantine Agreement
• Knowledge and common knowledge in a distributed environment
• Automatically increasing the fault-tolerance of distributed algorithms
• Early stopping in Byzantine agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• The Distributed Firing Squad Problem
• Simulating synchronized clocks and common knowledge in distributed systems
• The possibility and the complexity of achieving fault-tolerant coordination

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