On the public citation graph
On the relationship between the atomic commitment and consensus problems
0 signed · 85 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-08755-9_9openalex-snapshot
Notes on data base operating systems
inferredcites →https://doi.org/10.1016/0010-4485(78)90118-5openalex-snapshot
Operating systems — an advanced course
inferredcites →https://doi.org/10.1109/proc.1978.11114openalex-snapshot
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
inferredcites →https://doi.org/10.1109/sfcs.1983.41openalex-snapshot
On the minimal synchronism needed for distributed consensus
inferredcites →https://doi.org/10.1145/3149.214121openalex-snapshot
Impossibility of distributed consensus with one faulty process
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
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
inferredcites →https://doi.org/10.1145/79147.79161openalex-snapshot
Knowledge and common knowledge in a distributed environment
inferredcites →https://doi.org/10.1145/800221.806705openalex-snapshot
The inherent cost of nonblocking commitment
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.5276openalex-snapshot
Non‐blocking two‐phase commit using blockchain
inferred← citeshttps://doi.org/10.1007/11767954_2openalex-snapshot
Atomic Commit and Negotiation in Service Oriented Computing
inferred← citeshttps://doi.org/10.1007/11776178_4openalex-snapshot
When Birds Die: Making Population Protocols Fault-Tolerant
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-36108-1_16openalex-snapshot
Failure Detection Lower Bounds on Registers and Consensus
inferred← citeshttps://doi.org/10.1007/3-540-37795-6_36openalex-snapshot
Middleware for Supporting Inter-organizational Interactions
inferred← citeshttps://doi.org/10.1007/3-540-37795-6_6openalex-snapshot
Comparing the Atomic Commitment and Consensus Problems
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-45627-9_2openalex-snapshot
Agreement Problems in Fault-Tolerant 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-48169-9_2openalex-snapshot
Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_84openalex-snapshot
A comparative analysis of two-phase-commit protocols
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_20openalex-snapshot
Time and message efficient reliable broadcasts
inferred← citeshttps://doi.org/10.1007/978-0-387-35520-7_4openalex-snapshot
Atomic Failure in Wide-Area Computation
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_38openalex-snapshot
On the Weakest Failure Detector for Non-Blocking Atomic Commit
inferred← citeshttps://doi.org/10.1007/978-3-032-12335-0_7openalex-snapshot
Interlock Protocol: Interactive Cross-L2 Atomic Transactions via Stateless Shared Sequencer
inferred← citeshttps://doi.org/10.1007/978-3-319-11764-5_23openalex-snapshot
Tight Bounds for Stabilizing Uniform Consensus in Mobile Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-27308-2_4openalex-snapshot
Parallel Computing vs. Distributed Computing: A Great Confusion? (Position Paper)
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_19openalex-snapshot
Tight Bounds on Early Local Decisions in Uniform Consensus
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-642-10877-8_11openalex-snapshot
The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems
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/978-3-642-78658-7_7openalex-snapshot
Die Zeitabhängigkeit als maßgebliche Konsistenzbedingung und ihre Zusicherung durch ein neues fehlertolerantes Commit-Protokoll
inferred← citeshttps://doi.org/10.1007/bf01187074openalex-snapshot
Message-optimal protocols for Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/bf01667081openalex-snapshot
Connectivity requirements for Byzantine agreement under restricted types of failures
inferred← citeshttps://doi.org/10.1007/bf02998474openalex-snapshot
Solving agreement problems with failure detectors: a survey
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/bfb0030680openalex-snapshot
Heartbeat: A timeout-free failure detector for quiescent reliable communication
inferred← citeshttps://doi.org/10.1007/s00446-011-0146-4openalex-snapshot
The minimum information about failures for solving non-local tasks in message-passing systems
inferred← citeshttps://doi.org/10.1007/s00446-023-00446-0openalex-snapshot
Cross-chain payment protocols with success guarantees
inferred← citeshttps://doi.org/10.1007/s11227-020-03286-yopenalex-snapshot
FRLLE: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems
inferred← citeshttps://doi.org/10.1007/s42979-023-02216-yopenalex-snapshot
Asynchronous Consensus in Synchronous Systems Using send_to_all Primitive
inferred← citeshttps://doi.org/10.1007/s446-002-8027-4openalex-snapshot
Non-blocking atomic commit in asynchronous distributed systems with failure detectors
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.030openalex-snapshot
Capability-Passing Processes
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.05.018openalex-snapshot
On the Impact of Formal Methods in the SOA
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.10.001openalex-snapshot
Managed Agreement: Generalizing two fundamental distributed agreement problems
inferred← citeshttps://doi.org/10.1016/j.jalgor.2003.11.001openalex-snapshot
Uniform consensus is harder than consensus
inferred← citeshttps://doi.org/10.1016/j.scico.2007.01.007openalex-snapshot
Capability passing processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.09.014openalex-snapshot
Abstractions for fault-tolerant global computing
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80419-5openalex-snapshot
Abstractions for Fault-Tolerant Global Computing
inferred← citeshttps://doi.org/10.1109/49.414647openalex-snapshot
On the message and time complexity of protocols for reliable broadcasts/multicasts in networks with omission failures
inferred← citeshttps://doi.org/10.1109/dsn.2002.1028919openalex-snapshot
A realistic look at failure detectors
inferred← citeshttps://doi.org/10.1109/ftdcs.1995.525002openalex-snapshot
A generic multicast primitive to support transactions on replicated objects in distributed systems
inferred← citeshttps://doi.org/10.1109/ftdcs.1997.644710openalex-snapshot
A solution to atomic commitment based on an extended consensus protocol
inferred← citeshttps://doi.org/10.1109/icct.2000.890932openalex-snapshot
Message efficient reliable broadcast algorithm
inferred← citeshttps://doi.org/10.1109/icdcs.1989.37948openalex-snapshot
A protocol for timed atomic commitment
inferred← citeshttps://doi.org/10.1109/icdcs.1996.507924openalex-snapshot
Verifiable transaction atomicity for electronic payment protocols
inferred← citeshttps://doi.org/10.1109/real.2003.1253289openalex-snapshot
A consensus protocol for CAN-based systems
inferred← citeshttps://doi.org/10.1109/reldis.1995.518722openalex-snapshot
Non blocking atomic commitment with an unreliable failure detector
inferred← citeshttps://doi.org/10.1109/rtcsa.1996.554973openalex-snapshot
Designing a real-time recoverable action
inferred← citeshttps://doi.org/10.1109/sbrc.2014.19openalex-snapshot
Non-blocking Atomic Commitment with Byzantine Faults
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492674openalex-snapshot
Resolving message complexity of Byzantine Agreement and beyond
inferred← citeshttps://doi.org/10.1109/spdp.1995.530658openalex-snapshot
The Decentralized Non-Blocking Atomic Commitment Protocol
inferred← citeshttps://doi.org/10.1109/tencon.1999.818395openalex-snapshot
Message efficient uniform timed reliable broadcast
inferred← citeshttps://doi.org/10.1137/0220027openalex-snapshot
The Communication Complexity of Atomic Commitment and of Gossiping
inferred← citeshttps://doi.org/10.1137/070698877openalex-snapshot
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit
inferred← citeshttps://doi.org/10.1137/s0097539704446220openalex-snapshot
The Time-Complexity of Local Decision in Distributed Agreement
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/112600.112626openalex-snapshot
Message-optimal protocols for byzantine agreement (extended abstract)
inferred← citeshttps://doi.org/10.1145/28659.28672openalex-snapshot
A knowledge-theoretic analysis of atomic commitment protocols
inferred← citeshttps://doi.org/10.1145/2933057.2933120openalex-snapshot
Unbeatable Set Consensus via Topological and Combinatorial Reasoning
inferred← citeshttps://doi.org/10.1145/3350755.3400264openalex-snapshot
Feasibility of Cross-Chain Payment with Success Guarantees
inferred← citeshttps://doi.org/10.14778/3303753.3303765openalex-snapshot
Unifying consensus and atomic commitment for effective cloud data management
inferred← citeshttps://doi.org/10.2200/s00236ed1v01y201004dct002openalex-snapshot
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.2200/s00294ed1v01y201009dct003openalex-snapshot
Fault-tolerant Agreement in Synchronous Message-passing Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1311.6902openalex-snapshot
Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3261openalex-snapshot
Time-complexity bounds on agreement problems
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3262openalex-snapshot
Synchronization using failure detectors
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.