On the public citation graph

Minimal System Conditions to Implement Unreliable Failure Detectors

0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45414-4_8openalex-snapshot
Stable Leader Election
inferredcites →https://doi.org/10.1016/j.ipl.2006.05.009openalex-snapshot
Implementing unreliable failure detectors with unknown membership
inferredcites →https://doi.org/10.1016/j.jpdc.2004.11.001openalex-snapshot
Eventually consistent failure detectors
inferredcites →https://doi.org/10.1016/s0020-0190(98)00122-7openalex-snapshot
Reducing Ω to ◊
inferredcites →https://doi.org/10.1109/12.980014openalex-snapshot
On the quality of service of failure detectors
inferredcites →https://doi.org/10.1109/dsn.2002.1028920openalex-snapshot
Implementation and performance evaluation of an adaptable failure detector
inferredcites →https://doi.org/10.1109/dsn.2003.1209946openalex-snapshot
Asynchronous implementation of failure detectors
inferredcites →https://doi.org/10.1109/dsn.2006.34openalex-snapshot
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
inferredcites →https://doi.org/10.1109/prdc.2004.1276553openalex-snapshot
A hybrid approach for building eventually accurate failure detectors
inferredcites →https://doi.org/10.1109/prdc.2006.44openalex-snapshot
Minimal System Conditions to Implement Unreliable Failure Detectors
inferredcites →https://doi.org/10.1109/reldi.2000.885392openalex-snapshot
Optimal implementation of the weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1109/tc.2004.33openalex-snapshot
On the implementation of unreliable failure detectors in partially synchronous systems
inferredcites →https://doi.org/10.1145/1011767.1011816openalex-snapshot
Communication-efficient leader election and consensus with limited link synchrony
inferredcites →https://doi.org/10.1145/1041680.1041682openalex-snapshot
Total Order Broadcast and Multicast Algorithms : Taxonomy and Survey
inferredcites →https://doi.org/10.1145/1073814.1073849openalex-snapshot
The weakest failure detector to solve nonuniform consensus
inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferredcites →https://doi.org/10.1145/234533.234549openalex-snapshot
The weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/504192.504195openalex-snapshot
On the cost of fault-tolerant consensus when there are no faults
inferredcites →https://doi.org/10.1145/872035.872081openalex-snapshot
On implementing omega with weak reliability and synchrony assumptions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_39openalex-snapshot
An Unreliable Failure Detector for Unknown and Mobile Networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.10.011openalex-snapshot
A simple and communication-efficient Omega algorithm in the crash-recovery model
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.10.002openalex-snapshot
Implementing the Omega failure detector in the crash-recovery failure model
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.010openalex-snapshot
Communication-optimal eventually perfect failure detection in partially synchronous systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.06.003openalex-snapshot
Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures
inferred← citeshttps://doi.org/10.1016/j.jss.2011.06.019openalex-snapshot
Communication-efficient leader election in crash–recovery systems
inferred← citeshttps://doi.org/10.1109/ares.2008.31openalex-snapshot
From Omega to ?P in the Crash-Recovery Failure Model with Unknown Membership
inferred← citeshttps://doi.org/10.1109/pdp.2013.33openalex-snapshot
An Evaluation of Efficient Leader Election Algorithms for Crash-Recovery Systems
inferred← citeshttps://doi.org/10.1145/1073814.1073851openalex-snapshot
Brief announcement
inferred← citeshttps://doi.org/10.20868/upm.thesis.76516openalex-snapshot
Agreement in adversarial environments with anonymous and Byzantine elements
inferred← citeshttps://doi.org/10.4018/978-1-60960-042-6.ch063openalex-snapshot
Unreliable Failure Detectors for Mobile Ad-hoc Networks
showing the first 11 of 12 · page through all 12
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.