On the public citation graph

Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems

0 signed · 32 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/11561927_39openalex-snapshot
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
inferredcites →https://doi.org/10.1007/3-540-36108-1_12openalex-snapshot
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-39989-6_6openalex-snapshot
Efficient Replication of Large Data Objects
inferredcites →https://doi.org/10.1007/978-3-540-87779-0_13openalex-snapshot
Optimistic Erasure-Coded Distributed Storage
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1007/bf01786228openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1017/cbo9780511807077openalex-snapshot
Fundamentals of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/dsn.2005.96openalex-snapshot
Using Erasure Codes Efficiently for Storage in a Distributed System
inferredcites →https://doi.org/10.1109/dsn.2006.56openalex-snapshot
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
inferredcites →https://doi.org/10.1109/nca.2014.44openalex-snapshot
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
inferredcites →https://doi.org/10.1109/tit.1964.1053661openalex-snapshot
Maximum distanceq-nary codes
inferredcites →https://doi.org/10.1137/0108018openalex-snapshot
Polynomial Codes Over Certain Finite Fields
inferredcites →https://doi.org/10.1137/07071158xopenalex-snapshot
Multiwriter Consistency Conditions for Shared Memory Registers
inferredcites →https://doi.org/10.1145/1294261.1294269openalex-snapshot
Low-overhead byzantine fault-tolerant storage
inferredcites →https://doi.org/10.1145/1323293.1294269openalex-snapshot
Low-overhead byzantine fault-tolerant storage
inferredcites →https://doi.org/10.1145/1944345.1944348openalex-snapshot
Dynamic atomic storage without consensus
inferredcites →https://doi.org/10.1145/200836.200869openalex-snapshot
Sharing memory robustly in message-passing systems
inferredcites →https://doi.org/10.1145/2508859.2516750openalex-snapshot
PoWerStore
inferredcites →https://doi.org/10.1145/2933057.2933104openalex-snapshot
Space Bounds for Reliable Storage
inferredcites →https://doi.org/10.48550/arxiv.1507.05169openalex-snapshot
Space Bounds for Reliable Storage: Fundamental Limits of Coding

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-030-79527-6_7openalex-snapshot
Fragmented Objects: Boosting Concurrency of Shared Large Objects
inferred← citeshttps://doi.org/10.1007/s00453-022-01023-wopenalex-snapshot
Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00216openalex-snapshot
ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage
inferred← citeshttps://doi.org/10.1109/nca51143.2020.9306729openalex-snapshot
CassandrEAS: Highly Available and Storage-Efficient Distributed Key-Value Store with Erasure Coding
inferred← citeshttps://doi.org/10.1109/tcomm.2020.2981431openalex-snapshot
Fundamental Limits of Erasure-Coded Key-Value Stores With Side Information
inferred← citeshttps://doi.org/10.1109/tit.2017.2725273openalex-snapshot
Multi-Version Coding—An Information-Theoretic Perspective of Consistent Distributed Storage
inferred← citeshttps://doi.org/10.1145/3087801.3087832openalex-snapshot
A Layered Architecture for Erasure-Coded Consistent Distributed Storage
inferred← citeshttps://doi.org/10.1145/3510613openalex-snapshot
Ares : Adaptive, Reconfigurable, Erasure coded, Atomic Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1803.01098openalex-snapshot
Storage-Efficient Shared Memory Emulation
inferred← citeshttps://doi.org/10.48550/arxiv.2102.13310openalex-snapshot
CausalEC: A Causally Consistent Data Storage Algorithm based on Cross-Object Erasure Coding
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.