On the public citation graph
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
0 signed · 52 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/978-3-319-14472-6_6openalex-snapshot
Erasure-Coded Byzantine Storage with Separate Metadata
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/s00446-010-0117-1openalex-snapshot
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
inferredcites →https://doi.org/10.1017/cbo9780511808968openalex-snapshot
Introduction to Coding Theory
inferredcites →https://doi.org/10.1109/71.372774openalex-snapshot
Coding-based replication schemes for distributed systems
inferredcites →https://doi.org/10.1109/dsn.2004.1311883openalex-snapshot
A decentralized algorithm for erasure-coded virtual disks
inferredcites →https://doi.org/10.1109/dsn.2004.1311884openalex-snapshot
Efficient Byzantine-tolerant erasure-coded storage
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/dsn.2010.5544926openalex-snapshot
Efficient eventual consistency in Pahoehoe, an erasure-coded key-blob archive
inferredcites →https://doi.org/10.1109/ftcs.1997.614100openalex-snapshot
Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts
inferredcites →https://doi.org/10.1109/isit.2014.6874957openalex-snapshot
Multi-version coding in 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/reldis.2005.9openalex-snapshot
Asynchronous Veri.able Information Dispersal
inferredcites →https://doi.org/10.1137/0108018openalex-snapshot
Polynomial Codes Over Certain Finite Fields
inferredcites →https://doi.org/10.1145/1095809.1095817openalex-snapshot
Fault-scalable Byzantine fault-tolerant services
inferredcites →https://doi.org/10.1145/1294261.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/2447712.2447734openalex-snapshot
What can coding theory do for storage systems?
inferredcites →https://doi.org/10.1145/2447712.2447735openalex-snapshot
An overview of codes tailor-made for better repairability in networked distributed storage 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/377769.377776openalex-snapshot
Specifying and using a partitionable group communication service
inferredcites →https://doi.org/10.1145/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/800215.806583openalex-snapshot
Weighted voting for replicated data
inferredcites →https://doi.org/10.1145/93385.93441openalex-snapshot
Sharing memory robustly in message-passing systems
inferredcites →https://doi.org/10.2200/s00402ed1v01y201202dct009openalex-snapshot
Quorum Systems: With Applications to Storage and Consensus
inferredcites →https://doi.org/10.48550/arxiv.1407.4167openalex-snapshot
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
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-319-14472-6_6openalex-snapshot
Erasure-Coded Byzantine Storage with Separate Metadata
inferred← citeshttps://doi.org/10.1007/s00446-016-0275-xopenalex-snapshot
A coded shared atomic memory algorithm for message passing architectures
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00216openalex-snapshot
ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage
inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00057openalex-snapshot
Semi-Fast Byzantine-tolerant Shared Register without Reliable Broadcast
inferred← citeshttps://doi.org/10.1109/ipdps.2016.55openalex-snapshot
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2923616openalex-snapshot
Harnessing Correlations in Distributed Erasure-Coded Key-Value Stores
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/2933057.2933104openalex-snapshot
Space Bounds for Reliable Storage
inferred← citeshttps://doi.org/10.1145/2933057.2933118openalex-snapshot
Information-Theoretic Lower Bounds on the Storage Cost of Shared Memory Emulation
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
showing the first 13 of 14 · page through all 14
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.