scientific article; zbMATH DE number 7561269
From MaRDI portal
Publication:5090908
DOI10.4230/LIPICS.DISC.2018.17zbMath1497.68040MaRDI QIDQ5090908
Yehuda Afek, Eli Daian, Giuliano Losa, Eli Gafni
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Common2 extended to stacks and unbounded concurrency
- Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
- Impossibility of distributed consensus with one faulty process
- On the use of registers in achieving wait-free consensus
- On the Classification of Deterministic Objects via Set Agreement Power
- Generalized FLP impossibility result for t-resilient asynchronous computations
- A completeness theorem for a class of synchronization objects
- Consensus power makes (some) sense! (extended abstract)
- Deterministic Objects
- On the number of objects with distinct power and the linearizability of set agreement objects
This page was built for publication:
