On the public citation graph

Lucky Read/Write Access to Robust Atomic Storage

0 signed · 46 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_21openalex-snapshot
Minimal Byzantine Storage
inferredcites →https://doi.org/10.1007/3-540-37795-6_4openalex-snapshot
Lower Bounds for Asynchronous Consensus
inferredcites →https://doi.org/10.1007/3-540-48405-1_14openalex-snapshot
UMAC: Fast and Secure Message Authentication
inferredcites →https://doi.org/10.1007/3-540-61769-8openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-30186-8_29openalex-snapshot
Non-skipping Timestamps for Byzantine Data Storage Systems
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.1007/s00446-005-0124-9openalex-snapshot
The inherent price of indulgence
inferredcites →https://doi.org/10.1007/s00446-005-0151-6openalex-snapshot
Byzantine disk paxos: optimal resilience with byzantine shared memory
inferredcites →https://doi.org/10.1093/benz/9780199773787.article.b00010388openalex-snapshot
Baker, John H.
inferredcites →https://doi.org/10.1109/dsn.2004.1311884openalex-snapshot
Efficient Byzantine-tolerant erasure-coded storage
inferredcites →https://doi.org/10.1109/dsn.2006.50openalex-snapshot
Lucky Read/Write Access to Robust Atomic Storage
inferredcites →https://doi.org/10.1109/dsn.2006.56openalex-snapshot
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage
inferredcites →https://doi.org/10.1145/1011767.1011801openalex-snapshot
Byzantine disk paxos
inferredcites →https://doi.org/10.1145/1011767.1011802openalex-snapshot
How fast can a distributed atomic read be?
inferredcites →https://doi.org/10.1145/1073814.1073882openalex-snapshot
Brief announcement
inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot
Wait-free synchronization
inferredcites →https://doi.org/10.1145/1146381.1146419openalex-snapshot
How fast can a very robust read be?
inferredcites →https://doi.org/10.1145/121132.121164openalex-snapshot
Measurements of a distributed file system
inferredcites →https://doi.org/10.1145/200836.200869openalex-snapshot
Sharing memory robustly in message-passing systems
inferredcites →https://doi.org/10.1145/278298.278305openalex-snapshot
Fault-tolerant wait-free shared objects
inferredcites →https://doi.org/10.1145/357172.357176openalex-snapshot
The Byzantine Generals Problem
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/571825.571838openalex-snapshot
The inherent price of indulgence
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/96559.96565openalex-snapshot
Early stopping in Byzantine agreement

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/978-3-540-75142-7_13openalex-snapshot
Amnesic Distributed Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_14openalex-snapshot
On the Time-Complexity of Robust and Amnesic Storage
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_19openalex-snapshot
Efficient Robust Storage Using Secret Tokens
inferred← citeshttps://doi.org/10.1007/s00446-010-0103-7openalex-snapshot
Refined quorum systems
inferred← citeshttps://doi.org/10.1137/090757010openalex-snapshot
Fast Access to Distributed Atomic Memory
inferred← citeshttps://doi.org/10.1145/1146381.1146419openalex-snapshot
How fast can a very robust read be?
inferred← citeshttps://doi.org/10.1145/1281100.1281120openalex-snapshot
Refined quorum systems
inferred← citeshttps://doi.org/10.1145/1388240.1388257openalex-snapshot
Distributed computing in SOSP and OSDI
inferred← citeshttps://doi.org/10.1145/1529974.1529991openalex-snapshot
Low-latency access to robust amnesic storage
inferred← citeshttps://doi.org/10.1145/1993806.1993816openalex-snapshot
The complexity of robust atomic storage
inferred← citeshttps://doi.org/10.2200/s00402ed1v01y201202dct009openalex-snapshot
Quorum Systems: With Applications to Storage and Consensus
inferred← citeshttps://doi.org/10.2200/s01069ed1v01y202012dct017openalex-snapshot
Consistent Distributed Storage
inferred← citeshttps://doi.org/10.26083/tuprints-00003109openalex-snapshot
Data Consistency and Coordination for Untrusted Environments
inferred← citeshttps://doi.org/10.48550/arxiv.1212.3555openalex-snapshot
Proofs of Writing for Efficient and Robust Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4868openalex-snapshot
Asynchronous BFT Storage with 2t+1 Data Replicas
showing the first 16 of 17 · page through all 17
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.