Failure detectors as type boosters (Q1954255)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Failure detectors as type boosters	scientific article

Statements

scholarly article

0 references

Failure detectors as type boosters (English)

0 references

zbMATH Open document ID

0 references

10.1007/s00446-007-0043-z

0 references

Rachid Guerraoui

0 references

0 references

Distributed Computing

0 references

publication date

20 June 2013

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00446-007-0043-z

0 references

0 references

Atomic snapshots of shared memory

0 references

The impossibility of boosting distributed service resilience

0 references

0 references

Consensus power makes (some) sense! (extended abstract)

0 references

Generalized Irreducibility of Consensus and the Equivalence of <i>t</i>-Resilient and Wait-Free Implementations of Consensus

0 references

The weakest failure detector for solving consensus

0 references

Unreliable failure detectors for reliable distributed systems

0 references

On the minimal synchronism needed for distributed consensus

0 references

Impossibility of distributed consensus with one faulty process

0 references

On the weakest failure detector ever

0 references

Distributed Computing

0 references

Randomized wait-free concurrent objects (extended abstract)

0 references

Robust wait-free hierarchies

0 references

All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust

0 references

0 references

Failure detectors and the wait-free hierarchy (extended abstract)

0 references

Determining Consensus Numbers

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1954255

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1954255&oldid=35337651"