SOFSEM 2004: Theory and Practice of Computer Science

DOI10.1007/B95046zbMATH Open1202.68067OpenAlexW2916538296MaRDI QIDQ5902003FDOQ5902003

Authors: Bernadette Charron-Bost, Fabrice le Fessant 

Publication date: 4 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• The Time-Complexity of Local Decision in Distributed Agreement
• Bounds on the time to reach agreement in the presence of timing uncertainty
• A hierarchy of conditions for consensus solvability
• Synchronous condition-based consensus
• The complexity of early deciding set agreement

zbMATH Keywords

complexitydistributed algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (2)

• Managed agreement: generalizing two fundamental distributed agreement problems
• Bounds on the time to reach agreement in the presence of timing uncertainty

This page was built for publication: SOFSEM 2004: Theory and Practice of Computer Science

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