No double discount: condition-based simultaneity yields limited gain

DOI10.1016/j.ic.2012.02.006zbMath1237.68031OpenAlexW1993457622MaRDI QIDQ418187

Yoram Moses, Michel Raynal

Publication date: 24 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.ic.2012.02.006

zbMATH Keywords

lower bounddistributed algorithmcommon knowledgeconsensusmodularitysimultaneityagreement problemcondition-based agreementearly decisionprocess crash failureround-based computation modelsynchronous message-passing system

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (1)

On the bit security of cryptographic primitives

Cites Work

• Unnamed Item
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Programming simultaneous actions using common knowledge
• Continuous consensus via common knowledge
• Synchronous condition-based consensus
• A Layered Analysis of Consensus
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• Knowledge and common knowledge in a distributed environment
• Early stopping in Byzantine agreement
• No Double Discount: Condition-Based Simultaneity Yields Limited Gain
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• Asynchronous Agreement and Its Relation with Error-Correcting Codes

This page was built for publication: No double discount: condition-based simultaneity yields limited gain