On the Classification of Deterministic Objects via Set Agreement Power

DOI10.1145/3212734.3212775MaRDI QIDQ5197669zbMATH OpenOpenAlexFDO

Authors David Yu Cheng Chan, Vassos Hadzilacos, Sam Toueg

Publication date 19 September 2019

Published in Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3212734.3212775

zbMATH Keywords

asynchronous systemconsensus hierarchyset agreementshared memory

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• On the number of objects with distinct power and the linearizability of set agreement objects
• Byzantine-Tolerant Set-Constrained Delivery Broadcast
• On the computability power and the robustness of set agreement-oriented failure detector classes
• Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
• Irreducibility and additivity of set agreement-oriented failure detector classes
• On propositional coding techniques for the distinguishability of objects in finite sets
• On the use of ordered sets in problems of comparison and consensus of classifications
• Completeness criteria for classification problems with set-theoretical constraints
• Algorithmic estimate for aggregated powerset relations

Cited in

(5)

• On propositional coding techniques for the distinguishability of objects in finite sets
• Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
• scientific article; zbMATH DE number 7561269 (Why is no real title available?)
• Life beyond set agreement
• On the number of objects with distinct power and the linearizability of set agreement objects

This page was built for publication: On the Classification of Deterministic Objects via Set Agreement Power

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