Simultaneity is harder than agreement

DOI10.1016/0890-5401(91)90067-CzbMath0723.68014OpenAlexW2010212712MaRDI QIDQ757014

Cynthia Dwork, Brian A. Coan

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90067-c

zbMATH Keywords

distributed systemslower boundprotocoldistributed firing squadsimultaneous agreement

Mathematics Subject Classification ID

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

Related Items

The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols, Knowledge and common knowledge in a Byzantine environment: Crash failures, Hundreds of impossibility results for distributed computing, Near-optimal self-stabilising counting and firing squads, Simultaneity is harder than agreement

Cites Work

• Simultaneity is harder than agreement
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Programming simultaneous actions using common knowledge
• A lower bound for the time to assure interactive consistency
• Authenticated Algorithms for Byzantine Agreement
• Flipping Persuasively in Constant Time
• Knowledge and common knowledge in a distributed environment
• Early stopping in Byzantine agreement
• An O (log n ) expected rounds randomized byzantine generals protocol
• Simple constant-time consensus protocols in realistic failure models
• The Byzantine Generals Problem
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• The Distributed Firing Squad Problem