On Set Consensus Numbers

DOI10.1007/978-3-642-04355-0_8MaRDI QIDQ3646215zbMATH OpenOpenAlexFDO

Authors Eli Gafni, Petr Kuznetsov

Publication date 19 November 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-04355-0_8

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• On set consensus numbers
• On the weakest failure detector ever
• On the weakest failure detector ever
• The weakest failure detector for solving k-set agreement
• On the computability power and the robustness of set agreement-oriented failure detector classes

Cited in

(5)

• Bounded disagreement
• Bounded disagreement
• The relative power of composite loop agreement tasks
• On set consensus numbers
• The minimum information about failures for solving non-local tasks in message-passing systems

This page was built for publication: On Set Consensus Numbers

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