On the public citation graph
Using failure detectors to solve consensus in asynchronous shared-memory systems
0 signed · 82 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot
Fast randomized consensus using shared memory
inferredcites →https://doi.org/10.1109/sfcs.1992.267776openalex-snapshot
Fault-tolerant wait-free shared objects
inferredcites →https://doi.org/10.1145/112600.112627openalex-snapshot
Unreliable failure detectors for asynchronous systems (preliminary version)
inferredcites →https://doi.org/10.1145/135419.135431openalex-snapshot
Computing with faulty shared memory
inferredcites →https://doi.org/10.1145/135419.135451openalex-snapshot
The weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1145/164051.164078openalex-snapshot
On the space complexity of randomized synchronization
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.1145/800221.806707openalex-snapshot
Another advantage of free choice (Extended Abstract)
inferredcites →https://doi.org/10.1145/93385.93394openalex-snapshot
Atomic snapshots of shared memory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1998.0972openalex-snapshot
Fault-Local Distributed Mending
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_11openalex-snapshot
Computing with Reads and Writes in the Absence of Step Contention
inferred← citeshttps://doi.org/10.1007/11561927_15openalex-snapshot
(Almost) All Objects Are Universal in Message Passing Systems
inferred← citeshttps://doi.org/10.1007/11561927_8openalex-snapshot
Obstruction-Free Algorithms Can Be Practically Wait-Free
inferred← citeshttps://doi.org/10.1007/11901914_29openalex-snapshot
Proactive Leader Election in Asynchronous Shared Memory Systems
inferred← citeshttps://doi.org/10.1007/11945529_5openalex-snapshot
When Consensus Meets Self-stabilization
inferred← citeshttps://doi.org/10.1007/3-540-36108-1_16openalex-snapshot
Failure Detection Lower Bounds on Registers and Consensus
inferred← citeshttps://doi.org/10.1007/3-540-37795-6_29openalex-snapshot
A Data-Centric Approach for Scalable State Machine Replication
inferred← citeshttps://doi.org/10.1007/3-540-40026-5_9openalex-snapshot
On the Importance of Having an Identity or, is Consensus really Universal?
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_2openalex-snapshot
Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast
inferred← citeshttps://doi.org/10.1007/978-3-030-15032-7_24openalex-snapshot
On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion
inferred← citeshttps://doi.org/10.1007/978-3-030-25636-4_33openalex-snapshot
Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector
inferred← citeshttps://doi.org/10.1007/978-3-031-74498-3_1openalex-snapshot
On Distributed Computing: A View, Physical Versus Logical Objects, and a Look at Fully Anonymous Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-11127-2_9openalex-snapshot
Brief Announcement: Consensus in Systems with Eventual Quiescence
inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_12openalex-snapshot
t-Resilient Immediate Snapshot Is Impossible
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_21openalex-snapshot
On Failure Detectors and Type Boosters
inferred← citeshttps://doi.org/10.1007/978-3-540-92295-7_31openalex-snapshot
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
inferred← citeshttps://doi.org/10.1007/978-3-642-04355-0_6openalex-snapshot
The Disagreement Power of an Adversary
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_11openalex-snapshot
Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k$ the End of the Road?
inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_15openalex-snapshot
Failure Detectors Encapsulate Fairness
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_20openalex-snapshot
Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_43openalex-snapshot
From a Store-Collect Object and Ω to Efficient Asynchronous Consensus
inferred← citeshttps://doi.org/10.1007/bfb0030680openalex-snapshot
Heartbeat: A timeout-free failure detector for quiescent reliable communication
inferred← citeshttps://doi.org/10.1007/s00446-005-0121-zopenalex-snapshot
On the importance of having an identity or, is consensus really universal?
inferred← citeshttps://doi.org/10.1007/s00446-005-0123-xopenalex-snapshot
Active Disk Paxos with infinitely many processes
inferred← citeshttps://doi.org/10.1007/s00446-005-0151-6openalex-snapshot
Byzantine disk paxos: optimal resilience with byzantine shared memory
inferred← citeshttps://doi.org/10.1007/s00446-007-0043-zopenalex-snapshot
Failure detectors as type boosters
inferred← citeshttps://doi.org/10.1007/s00446-010-0101-9openalex-snapshot
Anti-Ω: the weakest failure detector for set agreement
inferred← citeshttps://doi.org/10.1007/s00446-010-0122-4openalex-snapshot
The disagreement power of an adversary
inferred← citeshttps://doi.org/10.1007/s00446-012-0164-xopenalex-snapshot
Failure detectors encapsulate fairness
inferred← citeshttps://doi.org/10.1007/s00453-008-9190-2openalex-snapshot
A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems
inferred← citeshttps://doi.org/10.1007/s10766-006-0008-zopenalex-snapshot
Light-Weight Leases for Storage-Centric Coordination
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.001openalex-snapshot
A weakest failure detector-based asynchronous consensus protocol for f
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.001openalex-snapshot
An impossibility about failure detectors in the iterated immediate snapshot model
inferred← citeshttps://doi.org/10.1016/j.jcss.2010.05.005openalex-snapshot
When consensus meets self-stabilization
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.03.015openalex-snapshot
On the weakest information on failures to solve mutual exclusion and consensus in asynchronous crash-prone read/write systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.007openalex-snapshot
On the road to the weakest failure detector for k -set agreement in message-passing systems
inferred← citeshttps://doi.org/10.1109/aina.2018.00035openalex-snapshot
Eventual Leader Election in Shared-Memory Dynamic Systems
inferred← citeshttps://doi.org/10.1109/cisis.2012.198openalex-snapshot
A Simple Asynchronous Shared Memory Consensus Algorithm Based on Omega and Closing Sets
inferred← citeshttps://doi.org/10.1109/dsn.2007.39openalex-snapshot
Electing an Eventual Leader in an Asynchronous Shared Memory System
inferred← citeshttps://doi.org/10.1109/isorc.2007.11openalex-snapshot
A Timing Assumption and a t-Resilient Protocol for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems
inferred← citeshttps://doi.org/10.1109/nca.2012.19openalex-snapshot
Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems
inferred← citeshttps://doi.org/10.1109/prdc.2013.16openalex-snapshot
A Generic Consensus Algorithm for Shared Memory
inferred← citeshttps://doi.org/10.1109/reldis.2002.1180213openalex-snapshot
From Byzantine agreement to practical survivability: a position paper
inferred← citeshttps://doi.org/10.1109/srds.2013.14openalex-snapshot
Consensus with Unknown Participants in Shared Memory
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/s0097539796312915openalex-snapshot
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
inferred← citeshttps://doi.org/10.1137/s0097539798341296openalex-snapshot
On Quiescent Reliable Communication
inferred← citeshttps://doi.org/10.1145/1011767.1011818openalex-snapshot
The weakest failure detectors to solve certain fundamental problems in distributed computing
inferred← citeshttps://doi.org/10.1145/1400751.1400762openalex-snapshot
Failure detectors in loosely named systems
inferred← citeshttps://doi.org/10.1145/1416729.1416777openalex-snapshot
Agreement and consistency without knowing the number of processes
inferred← citeshttps://doi.org/10.1145/1582716.1582735openalex-snapshot
The weakest failure detector for solving k-set agreement
inferred← citeshttps://doi.org/10.1145/1582716.1582737openalex-snapshot
Partial synchrony based on set timeliness
inferred← citeshttps://doi.org/10.1145/1582716.1582769openalex-snapshot
The disagreement power of an adversary
inferred← citeshttps://doi.org/10.1145/1883612.1883616openalex-snapshot
The failure detector abstraction
inferred← citeshttps://doi.org/10.1145/224964.224967openalex-snapshot
Fault-local distributed mending (extended abstract)
inferred← citeshttps://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferred← citeshttps://doi.org/10.1145/277697.277724openalex-snapshot
Round-by-round fault detectors (extended abstract)
inferred← citeshttps://doi.org/10.1145/277697.277755openalex-snapshot
Structured derivations of consensus algorithms for failure detectors
inferred← citeshttps://doi.org/10.1145/571825.571837openalex-snapshot
Active disk paxos with infinitely many processes
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3262openalex-snapshot
Synchronization using failure detectors
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.