The gap in circumventing the impossibility of consensus
From MaRDI portal
Publication:931725
DOI10.1016/j.jcss.2007.10.002zbMath1160.68003OpenAlexW2168796223MaRDI QIDQ931725
Rachid Guerraoui, Petr Kuznetsov
Publication date: 26 June 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/124853/files/YJCSS2285.pdf
Cites Work
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Robust wait-free hierarchies
- Determining Consensus Numbers
- The asynchronous computability theorem for t-resilient tasks
- Consensus power makes (some) sense! (extended abstract)
- Failure detectors and the wait-free hierarchy (extended abstract)
- Unnamed Item
This page was built for publication: The gap in circumventing the impossibility of consensus