On the public citation graph

Improved Time Bounds for Linearizable Implementations of Abstract Data Types

https://doi.org/10.1109/ipdps.2014.77
0 signed · 31 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/bf01191625openalex-snapshot
Efficiency of semisynchronous versus asynchronous networks
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1007/bf01843568openalex-snapshot
Easy impossibility proofs for distributed consensus problems
inferredcites →https://doi.org/10.1016/0022-0000(86)90028-0openalex-snapshot
On the possibility and impossibility of achieving clock synchronization
inferredcites →https://doi.org/10.1016/s0019-9958(84)80033-9openalex-snapshot
An upper and lower bound for clock synchronization
inferredcites →https://doi.org/10.1016/s0304-3975(98)90244-4openalex-snapshot
Linearizable read/write objects
inferredcites →https://doi.org/10.1109/12.9728openalex-snapshot
Commutativity-based concurrency control for abstract data types
inferredcites →https://doi.org/10.1109/mc.2011.389openalex-snapshot
Perspectives on the CAP Theorem
inferredcites →https://doi.org/10.1109/mc.2012.37openalex-snapshot
CAP twelve years later: How the "rules" have changed
inferredcites →https://doi.org/10.1137/s009753979936094xopenalex-snapshot
The Impact of Timing Knowledge on the Session Problem
inferredcites →https://doi.org/10.1145/1435417.1435432openalex-snapshot
Eventually consistent
inferredcites →https://doi.org/10.1145/164051.164068openalex-snapshot
Designing algorithms for distributed systems with partially synchronized clocks
inferredcites →https://doi.org/10.1145/1734213.1734216openalex-snapshot
Tight failure detection bounds on atomic object implementations
inferredcites →https://doi.org/10.1145/176575.176576openalex-snapshot
Sequential consistency versus linearizability
inferredcites →https://doi.org/10.1145/2402.322387openalex-snapshot
Efficiency of Synchronous Versus Asynchronous Distributed Systems
inferredcites →https://doi.org/10.1145/2429069.2429109openalex-snapshot
Quantitative relaxation of concurrent data structures
inferredcites →https://doi.org/10.1145/343477.343502openalex-snapshot
Towards robust distributed systems (abstract)
inferredcites →https://doi.org/10.1145/564585.564601openalex-snapshot
Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-01807-7_4openalex-snapshot
Formalization of Blockchain Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_15openalex-snapshot
Anomalies and Similarities Among Consensus Numbers of Variously-Relaxed Queues
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_203-1openalex-snapshot
Database Consistency Models
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_203-2openalex-snapshot
Database Consistency Models
inferred← citeshttps://doi.org/10.1007/978-3-319-69084-1_10openalex-snapshot
Relaxed Data Types as Consistency Conditions
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_203openalex-snapshot
Database Consistency Models
inferred← citeshttps://doi.org/10.1007/978-3-662-45174-8_29openalex-snapshot
Improving Average Performance by Relaxing Distributed Data Structures
inferred← citeshttps://doi.org/10.1007/s00607-018-0661-2openalex-snapshot
Anomalies and similarities among consensus numbers of variously-relaxed queues
inferred← citeshttps://doi.org/10.1016/j.ic.2018.08.004openalex-snapshot
Improved time bounds for linearizable implementations of abstract data types
inferred← citeshttps://doi.org/10.1145/3232679.3232691openalex-snapshot
Formalizing and Implementing Distributed Ledger Objects
inferred← citeshttps://doi.org/10.3390/a11050061openalex-snapshot
Relaxed Data Types as Consistency Conditions †
inferred← citeshttps://doi.org/10.48550/arxiv.1802.07817openalex-snapshot
Formalizing and Implementing Distributed Ledger Objects
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.