On the public citation graph
Quorum consensus in nested transaction systems
0 signed · 29 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-17187-8_42openalex-snapshot
Introduction to the theory of nested transactions
inferredcites →https://doi.org/10.1007/bf01786230openalex-snapshot
Mutual exclusion in partitioned distributed systems
inferredcites →https://doi.org/10.1007/bfb0042334openalex-snapshot
An efficient, fault-tolerant protocol for replicated data management
inferredcites →https://doi.org/10.1016/0304-3975(86)90014-9openalex-snapshot
Introduction to the theory of nested transactions
inferredcites →https://doi.org/10.1145/2166.357215openalex-snapshot
Guardians and Actions: Linguistic Support for Robust, Distributed Programs
inferredcites →https://doi.org/10.1145/28659.28669openalex-snapshot
Nested transactions and read-write locking
inferredcites →https://doi.org/10.1145/319989.319992openalex-snapshot
Achieving robustness in distributed database systems
inferredcites →https://doi.org/10.1145/320071.320076openalex-snapshot
A Majority consensus approach to concurrency control for multiple copy databases
inferredcites →https://doi.org/10.1145/325405.325443openalex-snapshot
An efficient, fault-tolerant protocol for replicated data management
inferredcites →https://doi.org/10.1145/356842.356846openalex-snapshot
Concurrency Control in Distributed Database Systems
inferredcites →https://doi.org/10.1145/357353.357355openalex-snapshot
Implementing atomic actions on decentralized data
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferredcites →https://doi.org/10.1145/588058.588080openalex-snapshot
Concurrency control for resilient nested transactions
inferredcites →https://doi.org/10.1145/588078.588080openalex-snapshot
Concurrency control for resilient nested transactions
inferredcites →https://doi.org/10.1145/6012.15418openalex-snapshot
Availability in partitioned replicated databases
inferredcites →https://doi.org/10.1145/63500.63501openalex-snapshot
Maintaining availability in partitioned replicated databases
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
inferredcites →https://doi.org/10.1145/800221.806709openalex-snapshot
A concurrency control theory for nested transactions (Preliminary Report)
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-50171-1_3openalex-snapshot
A theory of atomic transactions
inferred← citeshttps://doi.org/10.1007/3-540-51687-5_35openalex-snapshot
Highly concurrent logically synchronous multicast
inferred← citeshttps://doi.org/10.1007/3-540-54009-1_12openalex-snapshot
Multi-granularity locking for nested transaction systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3173-1_22openalex-snapshot
Commutativity-Based Locking for Nested Transactions
inferred← citeshttps://doi.org/10.1007/bf01784720openalex-snapshot
Highly concurrent logically synchronous multicast
inferred← citeshttps://doi.org/10.1007/bfb0042342openalex-snapshot
Bibliography for fault-tolerant distributed computing
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90014-9openalex-snapshot
Introduction to the theory of nested transactions
inferred← citeshttps://doi.org/10.1145/298514.298547openalex-snapshot
A serialization graph construction for nested transactions
inferred← citeshttps://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms
inferred← citeshttps://doi.org/10.1145/73721.73749openalex-snapshot
Concurrency control of nested transactions accessing B-trees
inferred← citeshttps://doi.org/10.1145/77600.77616openalex-snapshot
Concurrency and availability as dual properties of replicated atomic data
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.