Condition-based protocols for set agreement problems

DOI10.1007/3-540-36108-1_4MaRDI QIDQ4437114zbMATH OpenFDO

Authors Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy

Publication date 7 December 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2508/25080048.htm

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14)

Recommendations

• The combined power of conditions and failure detectors to solve asynchronous set agreement
• Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
• The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
• Condition-based consensus in synchronous systems
• \(K\)-set agreement with limited accuracy failure detectors

Cited in

(9)

• Tight bounds for k-set agreement with limited-scope failure detectors
• The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
• Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
• Distributed agreement and its relation with error-correcting codes
• Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
• The combined power of conditions and failure detectors to solve asynchronous set agreement
• On the Validity of Consensus
• A necessary condition for Byzantine \(k\)-set agreement
• New combinatorial topology bounds for renaming: the lower bound

This page was built for publication: Condition-based protocols for set agreement problems

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