On the public citation graph

A necessary and sufficient condition for transforming limited accuracy failure detectors

0 signed · 45 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.1006/inco.1993.1043openalex-snapshot
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems
inferredcites →https://doi.org/10.1007/3-540-46691-6_26openalex-snapshot
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus
inferredcites →https://doi.org/10.1007/3-540-48169-9_4openalex-snapshot
Solving Consensus Using Chandra-Toueg’s Unreliable Failure Detectors: A General Quorum-Based Approach
inferredcites →https://doi.org/10.1007/3-540-61769-8_18openalex-snapshot
“Γ-accurate” failure detectors
inferredcites →https://doi.org/10.1007/s004460050032openalex-snapshot
Early consensus in an asynchronous system with a weak failure detector
inferredcites →https://doi.org/10.1007/s004460050067openalex-snapshot
A simple and fast asynchronous consensus protocol based on a weak failure detector
inferredcites →https://doi.org/10.1016/0020-0190(87)90052-4openalex-snapshot
Extended impossibility results for asynchronous complete networks
inferredcites →https://doi.org/10.1016/s0020-0190(99)00136-2openalex-snapshot
Restricted failure detectors: Definition and reduction protocols
inferredcites →https://doi.org/10.1109/12.995450openalex-snapshot
A versatile family of consensus protocols based on Chandra-Toueg's unreliable failure detectors
inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferredcites →https://doi.org/10.1145/277697.277755openalex-snapshot
Structured derivations of consensus algorithms for failure detectors
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/343477.343536openalex-snapshot
k-set agreement with limited accuracy failure detectors
inferredcites →https://doi.org/10.1145/42282.42283openalex-snapshot
Consensus in the presence of partial synchrony
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11408901_2openalex-snapshot
Building and Using Quorums Despite any Number of Process of Crashes
inferred← citeshttps://doi.org/10.1007/11561927_16openalex-snapshot
Ω Meets Paxos: Leader Election and Stability Without Eventual Timely Links
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_13openalex-snapshot
On the Strongest Message Adversary for Consensus in Directed Dynamic Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_4openalex-snapshot
The Notion of Veto Number and the Respective Power of $\Diamond {\cal P}$ and $\Diamond {\cal S}$ to Solve One-Shot Agreement Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_11openalex-snapshot
Wait-Free Dining Under Eventual Weak Exclusion
inferred← citeshttps://doi.org/10.1007/s00446-009-0080-xopenalex-snapshot
The Theta-Model: achieving synchrony without clocks
inferred← citeshttps://doi.org/10.1016/j.aei.2021.101309openalex-snapshot
Assessment and prioritization method of key engineering characteristics for complex products based on cloud rough numbers
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.001openalex-snapshot
The Asynchronous Bounded-Cycle model
inferred← citeshttps://doi.org/10.1109/aina.2006.185openalex-snapshot
From failure detectors with limited scope accuracy to system-wide leadership
inferred← citeshttps://doi.org/10.1109/dsn.2003.1209946openalex-snapshot
Asynchronous implementation of failure detectors
inferred← citeshttps://doi.org/10.1109/dsn.2006.34openalex-snapshot
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
inferred← citeshttps://doi.org/10.1109/nca.2007.19openalex-snapshot
Eventual Leader Service in Unreliable Asynchronous Systems: Why? How?
inferred← citeshttps://doi.org/10.1109/prdc.2007.27openalex-snapshot
The Eventual Leadership in Dynamic Mobile Networking Environments
inferred← citeshttps://doi.org/10.1109/reldis.2004.1353022openalex-snapshot
Crash-resilient time-free eventual leadership
inferred← citeshttps://doi.org/10.1109/srds.2016.029openalex-snapshot
Who's On Board?: Probabilistic Membership for Real-Time Distributed Control Systems
inferred← citeshttps://doi.org/10.1109/srds.2016.27openalex-snapshot
WHO'S ON BOARD? Probabilistic Membership for Real-Time Distributed Control Systems
inferred← citeshttps://doi.org/10.1109/tc.2004.33openalex-snapshot
On the implementation of unreliable failure detectors in partially synchronous systems
inferred← citeshttps://doi.org/10.1109/tdsc.2008.24openalex-snapshot
Chasing the Weakest System Model for Implementing Ω and Consensus
inferred← citeshttps://doi.org/10.1109/tpds.2006.95openalex-snapshot
Time-free and timer-based assumptions can be combined to obtain eventual leadership
inferred← citeshttps://doi.org/10.1109/tpds.2007.1018openalex-snapshot
On the Respective Power of /spl Lozenge/P and /spl Lozenge/S to Solve One-Shot Agreement Problems
inferred← citeshttps://doi.org/10.1137/050645580openalex-snapshot
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
inferred← citeshttps://doi.org/10.1137/s009753970443999xopenalex-snapshot
Impossibility Results and Lower Bounds for Consensus under Link Failures
inferred← citeshttps://doi.org/10.1142/s0129626406002575openalex-snapshot
A TIME-FREE ASSUMPTION TO IMPLEMENT EVENTUAL LEADERSHIP
inferred← citeshttps://doi.org/10.1145/1011767.1011816openalex-snapshot
Communication-efficient leader election and consensus with limited link synchrony
inferred← citeshttps://doi.org/10.1145/1146381.1146408openalex-snapshot
Timeliness, failure-detectors, and consensus performance
inferred← citeshttps://doi.org/10.1145/1400751.1400815openalex-snapshot
The asynchronous bounded-cycle model
inferred← citeshttps://doi.org/10.2200/s00236ed1v01y201004dct002openalex-snapshot
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.25405/ncl.34130172openalex-snapshot
Design and Performance Analysis of Fail-Signal Based Consensus Protocols for Byzantine Faults
inferred← citeshttps://doi.org/10.47749/t/unicamp.2006.378387openalex-snapshot
Qualidade de serviço de detectores de defeitos na presença de rajadas de perdas de mensagens
inferred← citeshttps://doi.org/10.70675/6d6c196bz040bz443bzb25az79931ece7fe1openalex-snapshot
Computability Abstractions for Fault-tolerant Asynchronous Distributed Computing
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.