On the public citation graph

A comparison of the Byzantine Agreement problem and the Transaction Commit Problem

https://doi.org/10.1007/bfb0042322
0 signed · 39 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.1007/3-540-08755-9_9openalex-snapshot
Notes on data base operating systems
inferredcites →https://doi.org/10.1007/3-540-10571-9_11openalex-snapshot
Chapter 11. Atomic transactions
inferredcites →https://doi.org/10.1007/978-1-4020-9688-4_4openalex-snapshot
System Level Concurrency Control for Distributed Database Systems
inferredcites →https://doi.org/10.1145/29868.31332openalex-snapshot
On the reliability of consensus-based fault-tolerant distributed computing systems
inferredcites →https://doi.org/10.1145/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem

What points at this work

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

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/978-0-387-30162-4_91openalex-snapshot
Consensus with Partial Synchrony
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-1-4939-2864-4_91openalex-snapshot
Consensus with Partial Synchrony
inferred← citeshttps://doi.org/10.1007/978-3-030-43020-7_79openalex-snapshot
Non-Blocking Commitment Algorithm in Distributed Systems with Fail-Stop Model
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-642-32692-9_13openalex-snapshot
Solving Non-Blocking Atomic Commitment Problem in Asynchronous Distributed Systems with Unreliable Failure Detectors
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/bfb0022140openalex-snapshot
Revisiting the relationship between non-blocking atomic commitment and consensus
inferred← citeshttps://doi.org/10.1007/s10619-009-7051-xopenalex-snapshot
A cross-layer atomic commit protocol implementation for transaction processing in mobile ad-hoc networks
inferred← citeshttps://doi.org/10.1007/s10619-019-07267-wopenalex-snapshot
Efficient and non-blocking agreement protocols
inferred← citeshttps://doi.org/10.1007/s11390-014-1432-yopenalex-snapshot
A Non-Forced-Write Atomic Commit Protocol for Cluster File Systems
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/s0169-023x(03)00019-3openalex-snapshot
A conceptual model for increasing utilization of dependable computer networks
inferred← citeshttps://doi.org/10.1023/a:1014067816533openalex-snapshot
Dictatorial Transaction Processing: Atomic Commitment Without Veto Right
inferred← citeshttps://doi.org/10.1109/4434.895104openalex-snapshot
Atomic commit in concurrent computing
inferred← citeshttps://doi.org/10.1109/dasc.2007.1openalex-snapshot
Third IEEE International Symposium on Dependable, Autonomic and Secure Computing-Title
inferred← citeshttps://doi.org/10.1109/dasc.2007.10openalex-snapshot
A Byzantine Fault Tolerant Distributed Commit Protocol
inferred← citeshttps://doi.org/10.1109/dasc.2007.27openalex-snapshot
FileWall: A Firewall for Network File Systems
inferred← citeshttps://doi.org/10.1109/icct.2000.890932openalex-snapshot
Message efficient reliable broadcast algorithm
inferred← citeshttps://doi.org/10.1109/icdcs.1996.507924openalex-snapshot
Verifiable transaction atomicity for electronic payment protocols
inferred← citeshttps://doi.org/10.1109/icpads.1998.741040openalex-snapshot
One-phase commit: does it make sense?
inferred← citeshttps://doi.org/10.1109/isc246665.2019.9071682openalex-snapshot
Consensus of Whom? A Spectrum of Blockchain Consensus Protocols and New Directions
inferred← citeshttps://doi.org/10.1109/ispa.2008.31openalex-snapshot
CLCP – A Distributed Cross-Layer Commit Protocol for Mobile Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/itng.2013.13openalex-snapshot
Non-blocking Atomic Commitment Algorithm in Asynchronous Distributed Systems with Unreliable Failure Detectors
inferred← citeshttps://doi.org/10.1109/prdc.2006.17openalex-snapshot
An Efficient Commit Protocol Exploiting Primary-Backup Placement in a Distributed Storage System
inferred← citeshttps://doi.org/10.1109/tencon.1999.818395openalex-snapshot
Message efficient uniform timed reliable broadcast
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.1145/165123.165130openalex-snapshot
The TickerTAIP parallel RAID architecture
inferred← citeshttps://doi.org/10.1145/185514.185517openalex-snapshot
The TickerTAIP parallel RAID architecture
inferred← citeshttps://doi.org/10.1145/3616023openalex-snapshot
Transactional Cross-Chain Smart Contract Invocations
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.