On the public citation graph
Primary partition “Virtually-synchronous communication” harder than consensus
0 signed · 44 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.1007/3-540-56188-9_20openalex-snapshot
Membership algorithms for multicast communication groups
inferredcites →https://doi.org/10.1109/ftcs.1993.627356openalex-snapshot
Virtually-synchronous communication based on a weak failure suspector
inferredcites →https://doi.org/10.1109/icdcs.1991.148713openalex-snapshot
Membership algorithms for asynchronous distributed systems
inferredcites →https://doi.org/10.1109/icdcs.1993.287667openalex-snapshot
Uniform reliable multicast in a virtually synchronous environment
inferredcites →https://doi.org/10.1109/icdcs.1993.287668openalex-snapshot
Fast message ordering and membership using a logical token-passing ring
inferredcites →https://doi.org/10.1145/112600.112627openalex-snapshot
Unreliable failure detectors for asynchronous systems (preliminary version)
inferredcites →https://doi.org/10.1145/112600.112628openalex-snapshot
Using process groups to implement failure detection in asynchronous environments
inferredcites →https://doi.org/10.1145/128738.128742openalex-snapshot
Lightweight causal and atomic group multicast
inferredcites →https://doi.org/10.1145/135419.135451openalex-snapshot
The weakest failure detector for solving consensus
inferredcites →https://doi.org/10.1145/163298.163303openalex-snapshot
The process group approach to reliable distributed computing
inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.21236/ada253611openalex-snapshot
The Weakest Failure Detector for Solving Consensus
inferredcites →https://doi.org/10.21236/ada264352openalex-snapshot
Virtually-Synchronous Communication Based on a Weak Failure Suspector
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11573937_17openalex-snapshot
Revisiting the Election Problem in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/11751649_8openalex-snapshot
The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes
inferred← citeshttps://doi.org/10.1007/11758501_98openalex-snapshot
Solving Election Problem in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-36087-5_109openalex-snapshot
The Weakest Failure Detector for Solving Election Problems in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-44860-8_19openalex-snapshot
About the Relationship between Election Problem and Failure Detector in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-45785-2_22openalex-snapshot
Analysis of an Election Problem for CSCW in Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-46475-1_8openalex-snapshot
Programming Partition-Aware Network Applications?
inferred← citeshttps://doi.org/10.1007/978-1-4615-5449-3_2openalex-snapshot
Using Static Total Causal Ordering Protocols to Achieve Ordered View Synchrony
inferred← citeshttps://doi.org/10.1007/978-3-642-11294-2_6openalex-snapshot
A History of the Virtual Synchrony Replication Model
inferred← citeshttps://doi.org/10.1007/978-3-642-33078-0_29openalex-snapshot
Non-Blocking Atomic Commitment in Asynchronous Distributed Systems with Faulty Processes
inferred← citeshttps://doi.org/10.1007/bfb0020419openalex-snapshot
Distributed Algorithms: 8th International Workshop, Wdag'1994 Terschelling, the Netherlands September 29-October 1, 1994 : Proceedings
inferred← citeshttps://doi.org/10.1007/bfb0020420openalex-snapshot
Replicated file management in large-scale distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0022139openalex-snapshot
The inherent cost of strong-partial view-synchronous communication
inferred← citeshttps://doi.org/10.1007/bfb0022140openalex-snapshot
Revisiting the relationship between non-blocking atomic commitment and consensus
inferred← citeshttps://doi.org/10.1007/s11227-007-0112-xopenalex-snapshot
The election problem in asynchronous distributed systems with bounded faulty processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00398-xopenalex-snapshot
The Bancomat problem: an example of resource allocation in a partitionable asynchronous system
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00016-9openalex-snapshot
Application-based dynamic primary views in asynchronous distributed systems
inferred← citeshttps://doi.org/10.1109/12.600823openalex-snapshot
Enriched view synchrony: a programming paradigm for partitionable asynchronous distributed systems
inferred← citeshttps://doi.org/10.1109/32.748915openalex-snapshot
Client-access protocols for replicated services
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679497openalex-snapshot
Using broadcast primitives in replicated databases
inferred← citeshttps://doi.org/10.1109/iceccs.1997.622302openalex-snapshot
Client-access protocols for replicated services
inferred← citeshttps://doi.org/10.1109/icedeg65568.2025.11081531openalex-snapshot
From Dynamic Consent to Dynamic Governance: An Architecture for the Traceability of HSR
inferred← citeshttps://doi.org/10.1109/isorc.1999.776388openalex-snapshot
Enhancing replica management services to tolerate group failures
inferred← citeshttps://doi.org/10.1109/reldis.1997.632809openalex-snapshot
Selecting a "primary partition" in partitionable asynchronous distributed systems
inferred← citeshttps://doi.org/10.1145/224964.224976openalex-snapshot
Failure detectors and the wait-free hierarchy (extended abstract)
inferred← citeshttps://doi.org/10.1145/250007.250010openalex-snapshot
Group membership and view synchrony in partitionable asynchronous distributed systems
inferred← citeshttps://doi.org/10.1145/311531.311532openalex-snapshot
Fundamentals of fault-tolerant distributed computing in asynchronous environments
inferred← citeshttps://doi.org/10.48550/arxiv.1503.02241openalex-snapshot
An Analysis of a Virtually Synchronous Protocol
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.