Set agreement power is not a precise characterization for oblivious deterministic anonymous objects

DOI10.1007/978-3-030-24922-9_20MaRDI QIDQ2303296zbMATH OpenOpenAlexFDO

Authors Gadi Taubenfeld

Publication date 3 March 2020

Full work available at URL https://doi.org/10.1007/978-3-030-24922-9_20

zbMATH Keywords

consensusset agreementread/write registersanonymous objectsanonymous shared memoryRMW registers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)

Recommendations

• On the uncontended complexity of anonymous agreement
• On the Classification of Deterministic Objects via Set Agreement Power
• On the computability power and the robustness of set agreement-oriented failure detector classes
• On the uncontended complexity of anonymous consensus
• A characterization of oblivious message adversaries for which consensus is solvable
• Notions of anonymity for object assignment: impossibility theorems
• Anti-Ω
• On the number of objects with distinct power and the linearizability of set agreement objects
• Anti-\(\Omega \): the weakest failure detector for set agreement

Cited in

(4)

• On the Classification of Deterministic Objects via Set Agreement Power
• Leader-based de-anonymization of an anonymous read/write memory
• The computational structure of progress conditions and shared objects
• Mutual exclusion in fully anonymous shared memory systems

This page was built for publication: Set agreement power is not a precise characterization for oblivious deterministic anonymous objects

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