On the public citation graph

Fast Access to Distributed Atomic Memory

0 signed · 54 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/3-540-36108-1_12openalex-snapshot
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
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/978-3-540-39989-6_6openalex-snapshot
Efficient Replication of Large Data Objects
inferredcites →https://doi.org/10.1007/978-3-540-75142-7_4openalex-snapshot
Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
inferredcites →https://doi.org/10.1007/978-3-642-10877-8_20openalex-snapshot
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
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.1007/s00446-010-0103-7openalex-snapshot
Refined quorum systems
inferredcites →https://doi.org/10.1016/j.jpdc.2008.05.004openalex-snapshot
Fault-tolerant semifast implementations of atomic read/write registers
inferredcites →https://doi.org/10.1109/dsn.2006.50openalex-snapshot
Lucky Read/Write Access to Robust Atomic Storage
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/icdcs.2000.840958openalex-snapshot
Graceful quorum reconfiguration in a robust emulation of shared memory
inferredcites →https://doi.org/10.1109/reldis.1998.740474openalex-snapshot
Secure and scalable replication in Phalanx
inferredcites →https://doi.org/10.1145/1011767.1011802openalex-snapshot
How fast can a distributed atomic read be?
inferredcites →https://doi.org/10.1145/1024393.1024400openalex-snapshot
FAB
inferredcites →https://doi.org/10.1145/1037949.1024400openalex-snapshot
FAB
inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot
Wait-free synchronization
inferredcites →https://doi.org/10.1145/1400751.1400817openalex-snapshot
On the robustness of (semi) fast quorum-based implementations of atomic shared memory
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/322186.322188openalex-snapshot
Reaching Agreement in the Presence of Faults
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/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.1145/62044.62050openalex-snapshot
Efficient dispersal of information for security, load balancing, and fault tolerance
inferredcites →https://doi.org/10.5555/1251028.1251033openalex-snapshot
Ursa minor: versatile cluster-based storage

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-81404-4_3openalex-snapshot
Invited Paper: Distributed Computability: A Few Results Masters Students Should Know
inferred← citeshttps://doi.org/10.1007/978-3-319-46140-3_21openalex-snapshot
Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-49583-5_26openalex-snapshot
Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems
inferred← citeshttps://doi.org/10.1007/s00446-020-00379-yopenalex-snapshot
Tractable low-delay atomic memory
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.1007/s00607-018-0615-8openalex-snapshot
Time-efficient read/write register in crash-prone asynchronous message-passing systems
inferred← citeshttps://doi.org/10.1007/s10619-025-07455-xopenalex-snapshot
Revisiting shared registers and leaderless consensus in WAN environments
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.01.024openalex-snapshot
Implementing three exchange read operations for distributed atomic storage
inferred← citeshttps://doi.org/10.1109/dsn.2012.6263920openalex-snapshot
Robust data sharing with key-value stores
inferred← citeshttps://doi.org/10.1109/eurosp.2019.00021openalex-snapshot
ReplicaTEE: Enabling Seamless Replication of SGX Enclaves in the Cloud
inferred← citeshttps://doi.org/10.1109/tpds.2019.2919285openalex-snapshot
Proofs of Writing for Robust Storage
inferred← citeshttps://doi.org/10.1109/tpds.2020.3034328openalex-snapshot
Achieving Probabilistic Atomicity With Well-Bounded Staleness and Low Read Latency in Distributed Datastores
inferred← citeshttps://doi.org/10.1145/1993806.1993816openalex-snapshot
The complexity of robust atomic storage
inferred← citeshttps://doi.org/10.1145/1993806.1993843openalex-snapshot
Robust data sharing with key-value stores
inferred← citeshttps://doi.org/10.1145/2500874openalex-snapshot
Implementing distributed shared memory for dynamic networks
inferred← citeshttps://doi.org/10.1145/2508859.2516750openalex-snapshot
PoWerStore
inferred← citeshttps://doi.org/10.1145/3087801.3087824openalex-snapshot
Space Complexity of Fault-Tolerant Register Emulations
inferred← citeshttps://doi.org/10.1145/3382734.3405698openalex-snapshot
Fine-grained Analysis on Fast Implementations of Distributed Multi-writer Atomic Registers
inferred← citeshttps://doi.org/10.1145/3471469.3471484openalex-snapshot
Distributed Computability
inferred← citeshttps://doi.org/10.2200/s00402ed1v01y201202dct009openalex-snapshot
Quorum Systems: With Applications to Storage and Consensus
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2017.26openalex-snapshot
Efficient and Modular Consensus-Free Reconfiguration for Fault-Tolerant Storage
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.1508.03762openalex-snapshot
Space Bounds for Reliable Multi-Writer Data Store: Inherent Cost of Read/Write Primitives
inferred← citeshttps://doi.org/10.48550/arxiv.1610.08373openalex-snapshot
Oh-RAM! One and a Half Round Atomic Memory
inferred← citeshttps://doi.org/10.48550/arxiv.1705.07212openalex-snapshot
Space Complexity of Fault Tolerant Register Emulations
inferred← citeshttps://doi.org/10.48550/arxiv.1906.06420openalex-snapshot
Self-Stabilizing Snapshot Objects for Asynchronous Fail-Prone Network Systems
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.