On the public citation graph
Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts
0 signed · 132 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/bfb0042334openalex-snapshot
An efficient, fault-tolerant protocol for replicated data management
inferredcites →https://doi.org/10.1109/65.244792openalex-snapshot
Dealing with history and time in a distributed enterprise manager
inferredcites →https://doi.org/10.1109/reldis.1991.145411openalex-snapshot
A model for interface groups
inferredcites →https://doi.org/10.1109/reldis.1992.235146openalex-snapshot
Dynamic management of highly replicated data
inferredcites →https://doi.org/10.1137/s0895480198343819openalex-snapshot
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
inferredcites →https://doi.org/10.1145/200836.200869openalex-snapshot
Sharing memory robustly in message-passing systems
inferredcites →https://doi.org/10.1145/325405.325443openalex-snapshot
An efficient, fault-tolerant protocol for replicated data management
inferredcites →https://doi.org/10.1145/3788687openalex-snapshot
An Introduction to Input/Output Automata
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
inferredcites →https://doi.org/10.1145/5505.5508openalex-snapshot
Consistency in a partitioned network: a survey
inferredcites →https://doi.org/10.1145/63500.63501openalex-snapshot
Maintaining availability in partitioned replicated databases
inferredcites →https://doi.org/10.1145/78952.78953openalex-snapshot
Multicast routing in datagram internetworks and extended LANs
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11561927_13openalex-snapshot
Proving Atomicity: An Assertional Approach
inferred← citeshttps://doi.org/10.1007/11795490_27openalex-snapshot
Reconfigurable Distributed Storage for Dynamic Networks
inferred← citeshttps://doi.org/10.1007/3-540-36108-1_12openalex-snapshot
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
inferred← citeshttps://doi.org/10.1007/3-540-37795-6_12openalex-snapshot
Communication and Data Sharing for Dynamic Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_5openalex-snapshot
A Dynamic Primary Configuration Group Communication Service
inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_12openalex-snapshot
Unleashing and Speeding Up Readers in Atomic Object Implementations
inferred← citeshttps://doi.org/10.1007/978-3-030-31277-0_9openalex-snapshot
Self-stabilization Overhead: A Case Study on Coded Atomic Storage
inferred← citeshttps://doi.org/10.1007/978-3-030-75018-3_51openalex-snapshot
Robust and Strongly Consistent Distributed Storage Systems
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/978-3-031-21017-4_3openalex-snapshot
Invited Paper: Towards Practical Atomic Distributed Shared Memory: An Experimental Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_32openalex-snapshot
A Practical Distributed Universal Construction with Unknown Participants
inferred← citeshttps://doi.org/10.1007/978-3-319-21741-3_17openalex-snapshot
Self-stabilizing Virtual Synchrony
inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_20openalex-snapshot
Disaster-Tolerant Storage with SDN
inferred← citeshttps://doi.org/10.1007/978-3-319-46140-3_14openalex-snapshot
A Fault-Tolerant Sequentially Consistent DSM with a Compositional Correctness Proof
inferred← citeshttps://doi.org/10.1007/978-3-319-59647-1_10openalex-snapshot
Oh-RAM! One and a Half Round Atomic Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_17openalex-snapshot
Long-Lived Rambo: Trading Knowledge for Communication
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_6openalex-snapshot
Efficient Replication of Large Data Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_13openalex-snapshot
Optimistic Erasure-Coded Distributed Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_20openalex-snapshot
On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
inferred← citeshttps://doi.org/10.1007/978-3-642-03095-6_55openalex-snapshot
Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network
inferred← citeshttps://doi.org/10.1007/978-3-642-10877-8_20openalex-snapshot
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_11openalex-snapshot
SmartMerge: A New Approach to Reconfiguration for Atomic Storage
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_6openalex-snapshot
Simulating a Shared Register in an Asynchronous System that Never Stops Changing
inferred← citeshttps://doi.org/10.1007/s00446-004-0114-3openalex-snapshot
Scalable and dynamic quorum systems
inferred← citeshttps://doi.org/10.1007/s00446-010-0117-1openalex-snapshot
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
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.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/s10619-025-07455-xopenalex-snapshot
Revisiting shared registers and leaderless consensus in WAN environments
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.04.003openalex-snapshot
Practically-self-stabilizing virtual synchrony
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.05.004openalex-snapshot
Fault-tolerant semifast implementations of atomic read/write registers
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.07.007openalex-snapshot
Reconfigurable distributed storage for dynamic networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.052openalex-snapshot
Long-lived Rambo: Trading knowledge for communication
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00016-9openalex-snapshot
Application-based dynamic primary views in asynchronous distributed systems
inferred← citeshttps://doi.org/10.1093/comjnl/42.7.613openalex-snapshot
Availability Evaluation of Quorum-Based Mutual Exclusion Schemes in General Topology Networks
inferred← citeshttps://doi.org/10.1109/ccgrid.2005.1558657openalex-snapshot
A practical transparent data sharing service for the grid
inferred← citeshttps://doi.org/10.1109/dsn.2002.1028922openalex-snapshot
Small byzantine quorum systems
inferred← citeshttps://doi.org/10.1109/dsn.2003.1209936openalex-snapshot
Rambo II: rapidly reconfigurable atomic memory for dynamic networks
inferred← citeshttps://doi.org/10.1109/dsn.2004.1311883openalex-snapshot
A decentralized algorithm for erasure-coded virtual disks
inferred← citeshttps://doi.org/10.1109/dsn.2012.6263920openalex-snapshot
Robust data sharing with key-value stores
inferred← citeshttps://doi.org/10.1109/edcc-7.2008.16openalex-snapshot
Deriving Highly Available Quorum Systems from Structural Failure Models
inferred← citeshttps://doi.org/10.1109/ftcs.1998.689477openalex-snapshot
A fault-tolerant algorithm for decentralized on-line quorum adaptation
inferred← citeshttps://doi.org/10.1109/icdcs.1999.776512openalex-snapshot
Using hysteresis to reduce adaptation cost of a dynamic quorum assignment
inferred← citeshttps://doi.org/10.1109/icdcs.2000.840958openalex-snapshot
Graceful quorum reconfiguration in a robust emulation of shared memory
inferred← citeshttps://doi.org/10.1109/icdcs.2004.1281605openalex-snapshot
Robust emulations of shared memory in a crash-recovery model
inferred← citeshttps://doi.org/10.1109/icdcs.2007.80openalex-snapshot
A High Throughput Atomic Storage Algorithm
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00216openalex-snapshot
ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage
inferred← citeshttps://doi.org/10.1109/icdsn.2000.857551openalex-snapshot
Dynamic byzantine quorum systems
inferred← citeshttps://doi.org/10.1109/icmla.2018.00105openalex-snapshot
Interpretability and Reproducability in Production Machine Learning Applications
inferred← citeshttps://doi.org/10.1109/icppw.2006.40openalex-snapshot
How to Improve the Scalability of Read/Write Operations with Dynamic Reconfiguration of a Tree-Structured Coterie
inferred← citeshttps://doi.org/10.1109/icse.2000.870438openalex-snapshot
An inheritance-based technique for building simulation proofs incrementally
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303237openalex-snapshot
Implementing a recon .gurable atomic memory service for dynamic networks
inferred← citeshttps://doi.org/10.1109/ispan.2005.67openalex-snapshot
P2P Architecture for Self-Atomic Memory
inferred← citeshttps://doi.org/10.1109/ispdc.2006.29openalex-snapshot
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
inferred← citeshttps://doi.org/10.1109/nca.2005.16openalex-snapshot
Developing a Consistent Domain-Oriented Distributed Object Service
inferred← citeshttps://doi.org/10.1109/nca.2011.18openalex-snapshot
Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers
inferred← citeshttps://doi.org/10.1109/nca.2014.44openalex-snapshot
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
inferred← citeshttps://doi.org/10.1109/nca.2016.7778622openalex-snapshot
Cover-ability: Consistent versioning in asynchronous, fail-prone, message-passing environments
inferred← citeshttps://doi.org/10.1109/srds.2006.47openalex-snapshot
Weakly-Persistent Causal Objects in Dynamic Distributed Systems
inferred← citeshttps://doi.org/10.1109/srds64841.2024.00027openalex-snapshot
Ares II: Tracing the Flaws of a (Storage) God
inferred← citeshttps://doi.org/10.1109/tpds.2008.243openalex-snapshot
Developing a Consistent Domain-Oriented Distributed Object Service
inferred← citeshttps://doi.org/10.1109/tpds.2015.2499772openalex-snapshot
Rollup: Non-Disruptive Rolling Upgrade with Fast Consensus-Based Dynamic Reconfigurations
inferred← citeshttps://doi.org/10.1109/tpds.2018.2867479openalex-snapshot
Emulating a Shared Register in a System That Never Stops Changing
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.1137/090757010openalex-snapshot
Fast Access to Distributed Atomic Memory
inferred← citeshttps://doi.org/10.1145/1011767.1011802openalex-snapshot
How fast can a distributed atomic read be?
inferred← citeshttps://doi.org/10.1145/1148109.1148158openalex-snapshot
Fault-tolerant semifast implementations of atomic read/write registers
inferred← citeshttps://doi.org/10.1145/1328911.1328923openalex-snapshot
The collective memory of amnesic processes
inferred← citeshttps://doi.org/10.1145/1400751.1400817openalex-snapshot
On the robustness of (semi) fast quorum-based implementations of atomic shared memory
inferred← citeshttps://doi.org/10.1145/1582716.1582726openalex-snapshot
Dynamic atomic storage without consensus
inferred← citeshttps://doi.org/10.1145/1944345.1944348openalex-snapshot
Dynamic atomic storage without consensus
inferred← citeshttps://doi.org/10.1145/1993806.1993843openalex-snapshot
Robust data sharing with key-value stores
inferred← citeshttps://doi.org/10.1145/2034640.2034643openalex-snapshot
Quorum-based dynamic regular registers in systems with churn
inferred← citeshttps://doi.org/10.1145/2500874openalex-snapshot
Implementing distributed shared memory for dynamic networks
inferred← citeshttps://doi.org/10.1145/337180.337358openalex-snapshot
An inheritance-based technique for building simulation proofs incrementally
inferred← citeshttps://doi.org/10.1145/3373376.3378496openalex-snapshot
Hermes: A Fast, Fault-Tolerant and Linearizable Replication Protocol
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/3447865.3457964openalex-snapshot
Towards the Synthesis of Coherence/Replication Protocols from Consistency Models via Real-Time Orderings
inferred← citeshttps://doi.org/10.1145/3510613openalex-snapshot
Ares : Adaptive, Reconfigurable, Erasure coded, Atomic Storage
inferred← citeshttps://doi.org/10.1145/3519270.3538446openalex-snapshot
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations
inferred← citeshttps://doi.org/10.1145/3558481.3591086openalex-snapshot
Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and Write
inferred← citeshttps://doi.org/10.1145/3656019.3676944openalex-snapshot
Toast: A Heterogeneous Memory Management System
inferred← citeshttps://doi.org/10.1145/3694715.3695945openalex-snapshot
SWARM: Replicating Shared Disaggregated-Memory Data in No Time
inferred← citeshttps://doi.org/10.1145/504087.504090openalex-snapshot
An inheritance-based technique for building simulation proofs incrementally
inferred← citeshttps://doi.org/10.1145/872035.872052openalex-snapshot
Scalable and dynamic quorum systems
inferred← citeshttps://doi.org/10.1145/954092.954102openalex-snapshot
ACM SIGACT news distributed computing column 13
inferred← citeshttps://doi.org/10.1145/992287.992298openalex-snapshot
A pleasant stroll through the land of infinitely many creatures
inferred← citeshttps://doi.org/10.14778/3626292.3626304openalex-snapshot
Confidential Consortium Framework: Secure Multiparty Applications with Confidentiality, Integrity, and High Availability
inferred← citeshttps://doi.org/10.14778/3746405.3746411openalex-snapshot
The LAW Theorem: Local Reads and Linearizable Asynchronous Replication
inferred← citeshttps://doi.org/10.21236/ada466773openalex-snapshot
Proving Atomicity: An Assertional Approach
inferred← citeshttps://doi.org/10.2200/s00402ed1v01y201202dct009openalex-snapshot
Quorum Systems: With Applications to Storage and Consensus
inferred← citeshttps://doi.org/10.3166/tsi.30.809-839openalex-snapshot
Emulation de mémoire partagée en environnements distribués dynamiques
inferred← citeshttps://doi.org/10.3390/electronics12183801openalex-snapshot
Byzantine Fault-Tolerant Consensus Algorithms: A Survey
inferred← citeshttps://doi.org/10.4230/lipics.disc.2021.7openalex-snapshot
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
inferred← citeshttps://doi.org/10.4230/lipics.opodis.2015.19openalex-snapshot
Making "Fast" Atomic Operations Computationally Tractable
inferred← citeshttps://doi.org/10.48550/arxiv.1111.2693openalex-snapshot
On the Practicality of Atomic MWMR Register Implementations
inferred← citeshttps://doi.org/10.48550/arxiv.1309.2772openalex-snapshot
A Practical Distributed Universal Construction with Unknown Participants
inferred← citeshttps://doi.org/10.48550/arxiv.1407.4167openalex-snapshot
A Coded Shared Atomic Memory Algorithm for Message Passing Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1601.07352openalex-snapshot
CoVer-ability: Consistent Versioning for Concurrent Objects
inferred← citeshttps://doi.org/10.48550/arxiv.1608.02442openalex-snapshot
A Fault-Tolerant Sequentially Consistent DSM With a Compositional Correctness Proof
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.1708.03274openalex-snapshot
Simulating a Shared Register in a System that Never Stops Changing
inferred← citeshttps://doi.org/10.48550/arxiv.1807.07901openalex-snapshot
Self-stabilization Overhead: an Experimental Case Study on Coded Atomic Storage
inferred← citeshttps://doi.org/10.48550/arxiv.1910.06716openalex-snapshot
Byzantine-Tolerant Register in a System with Continuous Churn
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3999openalex-snapshot
The complexity of reliable distributed storage
inferred← citeshttps://doi.org/10.70675/622ef5b0zb664z4e5czbe30z3348c766562dopenalex-snapshot
Revisiting weighted quorums and asynchronous reconfiguration for atomic storage
inferred← citeshttps://doi.org/10.70675/a9b17839z3659z470ez8e34zbb033848b575openalex-snapshot
Building distributed computing abstractions in the presence of mobile byzantine failures
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.