On the public citation graph

Liquid Cloud Storage

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/11558989_21openalex-snapshot
High Availability in DHTs: Erasure Coding vs. Replication
inferredcites →https://doi.org/10.1109/allerton.2012.6483236openalex-snapshot
Coding for fast content download
inferredcites →https://doi.org/10.1109/infcom.2007.232openalex-snapshot
Network Coding for Distributed Storage Systems
inferredcites →https://doi.org/10.1109/tit.2010.2054295openalex-snapshot
Network Coding for Distributed Storage Systems
inferredcites →https://doi.org/10.1109/tit.2012.2208937openalex-snapshot
On the Locality of Codeword Symbols
inferredcites →https://doi.org/10.1145/2043556.2043571openalex-snapshot
Windows Azure Storage
inferredcites →https://doi.org/10.1145/2611354.2611370openalex-snapshot
Lazy Means Smart
inferredcites →https://doi.org/10.1145/2619239.2626325openalex-snapshot
A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers
inferredcites →https://doi.org/10.1145/263876.263881openalex-snapshot
Effective erasure codes for reliable computer communication protocols
inferredcites →https://doi.org/10.14778/2535573.2488339openalex-snapshot
XORing elephants
inferredcites →https://doi.org/10.1561/0100000060openalex-snapshot
Raptor Codes
inferredcites →https://doi.org/10.17487/rfc5040openalex-snapshot
A Remote Direct Memory Access Protocol Specification
inferredcites →https://doi.org/10.17487/rfc5510openalex-snapshot
Reed-Solomon Forward Error Correction (FEC) Schemes
inferredcites →https://doi.org/10.17487/rfc6330openalex-snapshot
RaptorQ Forward Error Correction Scheme for Object Delivery
inferredcites →https://doi.org/10.17487/rfc7540openalex-snapshot
Hypertext Transfer Protocol Version 2 (HTTP/2)
inferredcites →https://doi.org/10.21236/ada561775openalex-snapshot
Understanding TCP Incast and Its Implications for Big Data Workloads

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s11432-018-9482-6openalex-snapshot
Erasure coding for distributed storage: an overview
inferred← citeshttps://doi.org/10.1007/s12083-021-01206-2openalex-snapshot
On the robustness of three classes of rateless codes against pollution attacks in P2P networks
inferred← citeshttps://doi.org/10.1016/j.future.2025.107832openalex-snapshot
Data-loss models for proactive-tolerance Reed–Solomon storage systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103516openalex-snapshot
Repair friendly wide-stripe erasure coding for in-memory key–value stores
inferred← citeshttps://doi.org/10.1109/access.2021.3054954openalex-snapshot
An Optimal Tree-Structured Repair Scheme of Multiple Failure Nodes for Distributed Storage Systems
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00036openalex-snapshot
Boosting Multi-Block Repair in Cloud Storage Systems with Wide-Stripe Erasure Coding
inferred← citeshttps://doi.org/10.1109/isit.2019.8849745openalex-snapshot
Capacity of Dynamical Storage Systems
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206491openalex-snapshot
Designing Compact Repair Groups for Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653868openalex-snapshot
PMDS Array Codes Based on Punctured λ-twisted Circulant Matrices with Lower Complexity
inferred← citeshttps://doi.org/10.1109/tcc.2020.3035526openalex-snapshot
CPU: Cross-Rack-Aware Pipelining Update for Erasure-Coded Storage
inferred← citeshttps://doi.org/10.1109/tit.2018.2827942openalex-snapshot
Repairing Reed-Solomon Codes With Multiple Erasures
inferred← citeshttps://doi.org/10.1109/tit.2021.3052488openalex-snapshot
Repair Rate Lower Bounds for Distributed Storage
inferred← citeshttps://doi.org/10.1109/tit.2021.3120016openalex-snapshot
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
inferred← citeshttps://doi.org/10.1109/tr.2018.2878503openalex-snapshot
A Reliability Model for Dependent and Distributed MDS Disk Array Units
inferred← citeshttps://doi.org/10.1145/3405656.3418710openalex-snapshot
Liquid Data Networking
inferred← citeshttps://doi.org/10.1145/3462676.3462687openalex-snapshot
Systematic Vandermonde CODEC PE for Erasure Codes
inferred← citeshttps://doi.org/10.1145/3568313openalex-snapshot
Reliability Evaluation of Erasure-coded Storage Systems with Latent Errors
inferred← citeshttps://doi.org/10.1145/3708994openalex-snapshot
A Survey of the Past, Present, and Future of Erasure Coding for Storage Systems
inferred← citeshttps://doi.org/10.1561/0100000115openalex-snapshot
Codes for Distributed Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1806.04437openalex-snapshot
Erasure Coding for Distributed Storage: An Overview
inferred← citeshttps://doi.org/10.48550/arxiv.1806.04474openalex-snapshot
Erasure Codes for Distributed Storage: Tight Bounds and Matching Constructions
inferred← citeshttps://doi.org/10.48550/arxiv.2101.05223openalex-snapshot
Distributed storage algorithms with optimal tradeoffs
inferred← citeshttps://doi.org/10.70675/fb43b807zf46bz45e7z97eczab4a7145eacdopenalex-snapshot
Scalable and Efficient Data Management in Distributed Clouds : Service Provisioning and Data Processing
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.