On the public citation graph
Theory of concurrency control
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.
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.1016/0196-6774(81)90023-7openalex-snapshot
A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
inferredcites →https://doi.org/10.1109/sfcs.1976.12openalex-snapshot
Concurrency control for database systems
inferredcites →https://doi.org/10.1109/sfcs.1981.45openalex-snapshot
The complexity of distributed concurrency control
inferredcites →https://doi.org/10.1137/0211031openalex-snapshot
Freedom from Deadlock of Safe Locking Policies
inferredcites →https://doi.org/10.1145/322154.322158openalex-snapshot
The serializability of concurrent database updates
inferredcites →https://doi.org/10.1145/322169.322176openalex-snapshot
Consistency in Hierarchical Database Systems
inferredcites →https://doi.org/10.1145/322326.322333openalex-snapshot
A Theory of Safe Locking Policies in Database Systems
inferredcites →https://doi.org/10.1145/322344.322349openalex-snapshot
A theorem in database concurrency control
inferredcites →https://doi.org/10.1145/360363.360369openalex-snapshot
The notions of consistency and predicate locks in a database system
inferredcites →https://doi.org/10.1145/582095.582114openalex-snapshot
An optimality theory of concurrency control for databases
inferredcites →https://doi.org/10.1145/800076.802490openalex-snapshot
Issues of correctness in database concurrency control by locking
inferredcites →https://doi.org/10.21236/ada087996openalex-snapshot
Fundamental Algorithms for Concurrency Control in Distributed Database Systems.
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-54099-7_6openalex-snapshot
Distributed data structures: A complexity-oriented view
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_181openalex-snapshot
Scheduling in critical real-time systems: a manifesto
inferred← citeshttps://doi.org/10.1007/978-3-540-24851-4_16openalex-snapshot
Increasing Concurrency in Databases Using Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_7openalex-snapshot
On the Locality of Consistency Conditions
inferred← citeshttps://doi.org/10.1007/bf01231356openalex-snapshot
Chronological scheduling of transactions with temporal dependencies
inferred← citeshttps://doi.org/10.1007/bf02945367openalex-snapshot
A conservative multiversion locking-graph scheduler algorithm
inferred← citeshttps://doi.org/10.1007/bfb0022439openalex-snapshot
Implementing FIFO queues and stacks
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50022-6openalex-snapshot
Elements of Relational Database Theory
inferred← citeshttps://doi.org/10.1016/j.elerap.2005.10.010openalex-snapshot
Transaction management for m-commerce at a mobile terminal
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80024-8openalex-snapshot
On the complexity of concurrency control by locking in distributed database systems
inferred← citeshttps://doi.org/10.1109/71.159043openalex-snapshot
Checkpointing for distributed databases: starting from the basics
inferred← citeshttps://doi.org/10.1109/aina.2005.64openalex-snapshot
A Simple Protocol Offering Both Atomic Consistent Read Operations and Sequentially Consistent Read Operations
inferred← citeshttps://doi.org/10.1109/hicss.2003.1174215openalex-snapshot
Transaction management for m-commerce at a mobile terminal
inferred← citeshttps://doi.org/10.1109/icdcs.1990.89269openalex-snapshot
An abortion-free distributed deadlock detection/resolution algorithm
inferred← citeshttps://doi.org/10.1109/icdcs.1993.287679openalex-snapshot
Supporting reliable and atomic transaction management in multidatabase systems
inferred← citeshttps://doi.org/10.1109/icdcs.1998.679835openalex-snapshot
Consistency conditions for multi-object distributed operations
inferred← citeshttps://doi.org/10.1109/lics.1991.151648openalex-snapshot
Specifying and proving serializability in temporal logic
inferred← citeshttps://doi.org/10.1109/milcom.1990.117551openalex-snapshot
Congestion and race controlled software protocol methodology: Congestion controlled sequential contention resolution
inferred← citeshttps://doi.org/10.1109/ride.1993.281924openalex-snapshot
Commitment ordering based distributed concurrency control for bridging single and multi version resources
inferred← citeshttps://doi.org/10.1109/risp.1992.213261openalex-snapshot
A multilevel transaction problem for multilevel secure database systems and its solution for the replicated architecture
inferred← citeshttps://doi.org/10.1145/113379.113407openalex-snapshot
Sequential consistency versus linearizability (extended abstract)
inferred← citeshttps://doi.org/10.1145/176575.176576openalex-snapshot
Sequential consistency versus linearizability
inferred← citeshttps://doi.org/10.1145/6012.15403openalex-snapshot
Safety of non-well-locked transaction systems
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.