On the public citation graph
Revisiting the relationship between non-blocking atomic commitment and consensus
0 signed · 127 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-60042-6_9openalex-snapshot
Transaction model vs virtual synchrony model: bridging the gap
inferredcites →https://doi.org/10.1007/bf01786634openalex-snapshot
Transaction commit in a realistic timing model
inferredcites →https://doi.org/10.1007/bfb0020423openalex-snapshot
Primary partition “Virtually-synchronous communication” harder than consensus
inferredcites →https://doi.org/10.1007/bfb0042322openalex-snapshot
A comparison of the Byzantine Agreement problem and the Transaction Commit Problem
inferredcites →https://doi.org/10.1007/bfb0042324openalex-snapshot
A simple model for agreement in distributed systems
inferredcites →https://doi.org/10.1007/bfb0042336openalex-snapshot
On the relationship between the atomic commitment and consensus problems
inferredcites →https://doi.org/10.1109/reldis.1995.518722openalex-snapshot
Non blocking atomic commitment with an unreliable failure detector
inferredcites →https://doi.org/10.1109/spdp.1995.530658openalex-snapshot
The Decentralized Non-Blocking Atomic Commitment Protocol
inferredcites →https://doi.org/10.1145/112600.112627openalex-snapshot
Unreliable failure detectors for asynchronous systems (preliminary version)
inferredcites →https://doi.org/10.1145/135419.135451openalex-snapshot
The weakest failure detector for solving consensus
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.21236/ada253611openalex-snapshot
The Weakest Failure Detector for Solving Consensus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.1998.1566openalex-snapshot
Increasing the Resilience of Distributed and Replicated Database Systems
inferred← citeshttps://doi.org/10.1007/11429647_15openalex-snapshot
An Improved Algorithm for Adaptive Condition-Based Consensus
inferred← citeshttps://doi.org/10.1007/11572329_18openalex-snapshot
Generating Fast Atomic Commit from Hyperfast Consensus
inferred← citeshttps://doi.org/10.1007/11733447_8openalex-snapshot
An Optimistic NBAC-Based Fair Exchange Method for Arbitrary Items
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_18openalex-snapshot
The Surprising Power of Epidemic Communication
inferred← citeshttps://doi.org/10.1007/3-540-37795-6_24openalex-snapshot
Database Replication Based on Group Communication: Implementation Issues
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_37openalex-snapshot
Hosting of Libre Software Projects: A Distributed Peer-to-Peer Approach
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-37795-6_7openalex-snapshot
Open Questions on Consensus Performance inWell-Behaved Runs
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-45414-4_7openalex-snapshot
A Low-Latency Non-blocking Commit Service
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_2openalex-snapshot
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
inferred← citeshttps://doi.org/10.1007/3-540-48046-3_3openalex-snapshot
Encapsulating Failure Detection: From Crash to Byzantine Failures
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_4openalex-snapshot
Solving Consensus Using Chandra-Toueg’s Unreliable Failure Detectors: A General Quorum-Based Approach
inferred← citeshttps://doi.org/10.1007/3-540-48254-7_7openalex-snapshot
Muteness Failure Detectors: Specification and Implementation
inferred← citeshttps://doi.org/10.1007/3-540-61769-8_18openalex-snapshot
“Γ-accurate” failure detectors
inferred← citeshttps://doi.org/10.1007/3-540-63343-x_35openalex-snapshot
Building secure and reliable network applications
inferred← citeshttps://doi.org/10.1007/978-1-4471-2416-0_21openalex-snapshot
Peer-to-Peer Systems and Probabilistic Protocols
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-540-24591-9_15openalex-snapshot
Fair Exchange with Guardian Angels
inferred← citeshttps://doi.org/10.1007/978-3-540-25939-8_10openalex-snapshot
A Model and a Design Approach to Building QoS Adaptive Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30186-8_2openalex-snapshot
Synchronous Condition-Based Consensus Adapting to Input-Vector Legality
inferred← citeshttps://doi.org/10.1007/978-3-540-45214-0_18openalex-snapshot
DisCusS and FuSe: Considering Modularity, Genericness, and Adaptation in the Development of Consensus and Fault Detection Services
inferred← citeshttps://doi.org/10.1007/978-3-540-45214-0_29openalex-snapshot
On the Cost of Fault-Tolerant Consensus When There Are No Faults – A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-540-71703-4_23openalex-snapshot
The Circular Two-Phase Commit Protocol
inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_27openalex-snapshot
On the Probabilistic Omission Adversary
inferred← citeshttps://doi.org/10.1007/978-3-540-77048-0_27openalex-snapshot
Modeling Agreement Problems in the Universal Composability Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-85713-6_12openalex-snapshot
Efficient Execution of Small (Single-Tuple) Transactions in Main-Memory Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-05148-7_46openalex-snapshot
Reliable Communication Infrastructure for Adaptive Data Replication
inferred← citeshttps://doi.org/10.1007/978-94-015-9608-4_14openalex-snapshot
Atomic Broadcast In A Byzantine Model
inferred← citeshttps://doi.org/10.1007/bf02998474openalex-snapshot
Solving agreement problems with failure detectors: a survey
inferred← citeshttps://doi.org/10.1007/bfb0013477openalex-snapshot
Fault-tolerance by replication in distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0030680openalex-snapshot
Heartbeat: A timeout-free failure detector for quiescent reliable communication
inferred← citeshttps://doi.org/10.1007/bfb0053068openalex-snapshot
Protocol classes for designing reliable distributed environments
inferred← citeshttps://doi.org/10.1007/bfb0056487openalex-snapshot
A more committed quorum-based three phase commit protocol
inferred← citeshttps://doi.org/10.1007/s00446-005-0129-4openalex-snapshot
Dynamic group communication
inferred← citeshttps://doi.org/10.1007/s00446-006-0017-6openalex-snapshot
The overhead of consensus failure recovery
inferred← citeshttps://doi.org/10.1007/s00446-021-00389-4openalex-snapshot
Multi-shot distributed transaction commit
inferred← citeshttps://doi.org/10.1007/s00446-023-00446-0openalex-snapshot
Cross-chain payment protocols with success guarantees
inferred← citeshttps://doi.org/10.1007/s004460050032openalex-snapshot
Early consensus in an asynchronous system with a weak failure detector
inferred← citeshttps://doi.org/10.1007/s004460050067openalex-snapshot
A simple and fast asynchronous consensus protocol based on a weak failure detector
inferred← citeshttps://doi.org/10.1007/s10619-019-07261-2openalex-snapshot
Logless one-phase commit made possible for highly-available datastores
inferred← citeshttps://doi.org/10.1007/s10619-019-07267-wopenalex-snapshot
Efficient and non-blocking agreement protocols
inferred← citeshttps://doi.org/10.1007/s11227-015-1512-yopenalex-snapshot
Fault-tolerant broadcast in anonymous systems
inferred← citeshttps://doi.org/10.1007/s11276-008-0139-9openalex-snapshot
Topology control for fault-tolerant communication in wireless ad hoc networks
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.ipl.2006.07.003openalex-snapshot
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
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.jpdc.2004.11.001openalex-snapshot
Eventually consistent failure detectors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.02.004openalex-snapshot
Adaptive timeliness of consensus in presence of crash and timing faults
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00333-2openalex-snapshot
A simple proof of the uniform consensus synchronous lower bound
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00064-xopenalex-snapshot
On the weakest failure detector for hard agreement problems
inferred← citeshttps://doi.org/10.1109/71.879773openalex-snapshot
Computing global functions in asynchronous distributed systems with perfect failure detectors
inferred← citeshttps://doi.org/10.1109/aina.2014.129openalex-snapshot
Collision-Fast Atomic Broadcast
inferred← citeshttps://doi.org/10.1109/ares.2006.60openalex-snapshot
Evaluating certification protocols in the partial database state machine
inferred← citeshttps://doi.org/10.1109/dsn.2003.1209974openalex-snapshot
Comparison of failure detectors and group membership: performance study of two atomic broadcast algorithms
inferred← citeshttps://doi.org/10.1109/dsn.2004.1311894openalex-snapshot
Timed uniform consensus resilient to crash and timing faults
inferred← citeshttps://doi.org/10.1109/ftcs.1996.534604openalex-snapshot
Consensus service: a modular approach for building agreement protocols in distributed systems
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/ftdcs.1997.644722openalex-snapshot
Consensus: the big misunderstanding [distributed fault tolerant systems]
inferred← citeshttps://doi.org/10.1109/hase.1997.648067openalex-snapshot
A case study of agreement problems in distributed systems: non-blocking atomic commitment
inferred← citeshttps://doi.org/10.1109/icdcs.1996.508021openalex-snapshot
Reducing the cost for non-blocking in atomic commitment
inferred← citeshttps://doi.org/10.1109/icdcs.1999.776549openalex-snapshot
On classes of problems in asynchronous distributed systems with process crashes
inferred← citeshttps://doi.org/10.1109/icdcs.2000.840973openalex-snapshot
Computing global functions in asynchronous distributed systems prone to process crashes
inferred← citeshttps://doi.org/10.1109/icdsn.2000.857584openalex-snapshot
The best of both worlds: A hybrid approach to solve consensus
inferred← citeshttps://doi.org/10.1109/icpads.1998.741040openalex-snapshot
One-phase commit: does it make sense?
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846029openalex-snapshot
Consensus based on failure detectors with a perpetual accuracy property
inferred← citeshttps://doi.org/10.1109/ms.2001.936216openalex-snapshot
Mastering agreement problems in distributed systems
inferred← citeshttps://doi.org/10.1109/nca.2001.962546openalex-snapshot
Partial replication in the Database State Machine
inferred← citeshttps://doi.org/10.1109/reldi.2000.885388openalex-snapshot
Modeling fault-tolerant mobile agent execution as a sequence of agreement problems
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/reldis.1998.740510openalex-snapshot
Consensus in asynchronous systems where processes can crash and recover
inferred← citeshttps://doi.org/10.1109/reldis.1999.805083openalex-snapshot
A general framework to solve agreement problems
inferred← citeshttps://doi.org/10.1109/reldis.2004.1353001openalex-snapshot
Design and evaluation of a QoS-adaptive system for reliable multicasting
inferred← citeshttps://doi.org/10.1109/spdp.1995.530658openalex-snapshot
The Decentralized Non-Blocking Atomic Commitment Protocol
inferred← citeshttps://doi.org/10.1109/stfssd.2009.34openalex-snapshot
Model Checking a Modular-Structured Nonblocking Atomic Commitment Protocol for Asynchronous Distributed Systems
inferred← citeshttps://doi.org/10.1109/tc.2006.99openalex-snapshot
Condition adaptation in synchronous consensus
inferred← citeshttps://doi.org/10.1109/waina.2011.17openalex-snapshot
Providing Secure Integrity in Peer-to-Peer Oriented Mobile Environments
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/1041680.1041682openalex-snapshot
Total Order Broadcast and Multicast Algorithms : Taxonomy and Survey
inferred← citeshttps://doi.org/10.1145/1132863.1132867openalex-snapshot
Consensus on transaction commit
inferred← citeshttps://doi.org/10.1145/1146381.1146408openalex-snapshot
Timeliness, failure-detectors, and consensus performance
inferred← citeshttps://doi.org/10.1145/1160972.1160979openalex-snapshot
Construction of a fault-tolerant wireless communication topology using distributed agreement
inferred← citeshttps://doi.org/10.1145/1435523.1435524openalex-snapshot
Adaptive replication control based on consensus
inferred← citeshttps://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferred← citeshttps://doi.org/10.1145/3034786.3034799openalex-snapshot
How Fast can a Distributed Transaction Commit?
inferred← citeshttps://doi.org/10.1145/343477.343630openalex-snapshot
Indulgent algorithms (preliminary version)
inferred← citeshttps://doi.org/10.1145/378580.378747openalex-snapshot
Eventually consistent failure detectors
inferred← citeshttps://doi.org/10.1145/380752.380792openalex-snapshot
Conditions on input vectors for consensus solvability in asynchronous distributed systems
inferred← citeshttps://doi.org/10.1145/504192.504195openalex-snapshot
On the cost of fault-tolerant consensus when there are no faults
inferred← citeshttps://doi.org/10.1145/950620.950624openalex-snapshot
Conditions on input vectors for consensus solvability in asynchronous distributed systems
inferred← citeshttps://doi.org/10.14778/3303753.3303765openalex-snapshot
Unifying consensus and atomic commitment for effective cloud data management
inferred← citeshttps://doi.org/10.1561/1900000075openalex-snapshot
Consensus in Data Management: From Distributed Commit to Blockchain
inferred← citeshttps://doi.org/10.17169/refubium-21773openalex-snapshot
Optimistic fair transaction processing in mobile ad-hoc networks
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.48456/tr-667openalex-snapshot
Minimizing latency of agreement protocols
inferred← citeshttps://doi.org/10.5075/epfl-thesis-2577openalex-snapshot
Group communications and database replication : techniques, issues and performance
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3261openalex-snapshot
Time-complexity bounds on agreement problems
inferred← citeshttps://doi.org/10.5441/002/edbt.2018.15openalex-snapshot
EasyCommit: A Non-blocking Two-phase Commit 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.