On the public citation graph
Two Abstractions for Implementing Atomic Objects in Dynamic Systems
0 signed · 48 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.1006/jcss.2001.1819openalex-snapshot
Interval Consistency of Asynchronous Distributed Computations
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-40026-5_11openalex-snapshot
Computing with Infinitely Many Processes
inferredcites →https://doi.org/10.1007/3-540-44681-8_70openalex-snapshot
Building TMR-Based Reliable Servers Despite Bounded Input Lifetimes
inferredcites →https://doi.org/10.1007/3-540-45518-3_18openalex-snapshot
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
inferredcites →https://doi.org/10.1007/978-3-540-30469-2_39openalex-snapshot
An Architecture for Dynamic Scalable Self-Managed Persistent Objects
inferredcites →https://doi.org/10.1007/978-3-540-39989-6_7openalex-snapshot
On the Locality of Consistency Conditions
inferredcites →https://doi.org/10.1016/j.ipl.2004.12.011openalex-snapshot
Asynchronous bounded lifetime failure detectors
inferredcites →https://doi.org/10.1109/dsn.2004.1311902openalex-snapshot
A framework for dynamic Byzantine storage
inferredcites →https://doi.org/10.1109/icdsn.2000.857551openalex-snapshot
Dynamic byzantine quorum systems
inferredcites →https://doi.org/10.1109/tnet.2002.808407openalex-snapshot
Chord: a scalable peer-to-peer lookup protocol for internet applications
inferredcites →https://doi.org/10.1145/1011767.1011818openalex-snapshot
The weakest failure detectors to solve certain fundamental problems in distributed computing
inferredcites →https://doi.org/10.1145/200836.200869openalex-snapshot
Sharing memory robustly in message-passing systems
inferredcites →https://doi.org/10.1145/226643.226647openalex-snapshot
Unreliable failure detectors for reliable distributed systems
inferredcites →https://doi.org/10.1145/22952.22953openalex-snapshot
Dynamic quorum adjustment for partitioned data
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/3335772.3335934openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/4221.4223openalex-snapshot
How to assign votes in a distributed system
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/872035.872082openalex-snapshot
On using network attached disks as shared memory
inferredcites →https://doi.org/10.1145/992287.992298openalex-snapshot
A pleasant stroll through the land of infinitely many creatures
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-540-77096-1_31openalex-snapshot
Timed Quorum Systems for Large-Scale and Dynamic Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-10265-3_9openalex-snapshot
Joining a Distributed Shared Memory Computation in a Dynamic Distributed System
inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_3openalex-snapshot
Regular Register: An Implementation in a Churn Prone Environment
inferred← citeshttps://doi.org/10.1007/978-3-642-15277-1_50openalex-snapshot
Value-Based Sequential Consistency for Set Objects in Dynamic Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-27207-3_52openalex-snapshot
The Modeling Approaches of Distributed Computing Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-28765-7_35openalex-snapshot
Discrete Dynamical System Model of Distributed Computing with Embedded Partial Order
inferred← citeshttps://doi.org/10.1007/978-3-642-39958-9_5openalex-snapshot
Cliff-Edge Consensus: Agreeing on the Precipice
inferred← citeshttps://doi.org/10.1109/icdcs.2009.46openalex-snapshot
Implementing a Register in a Dynamic Distributed System
inferred← citeshttps://doi.org/10.1109/prdc.2007.27openalex-snapshot
The Eventual Leadership in Dynamic Mobile Networking Environments
inferred← citeshttps://doi.org/10.1109/reldis.2005.19openalex-snapshot
From Static Distributed Systems to Dynamic Systems
inferred← citeshttps://doi.org/10.1109/srds.2006.47openalex-snapshot
Weakly-Persistent Causal Objects in Dynamic Distributed Systems
inferred← citeshttps://doi.org/10.1109/tpds.2011.97openalex-snapshot
Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn
inferred← citeshttps://doi.org/10.1145/1841313.1841315openalex-snapshot
Probabilistic quorum systems in wireless Ad Hoc networks
inferred← citeshttps://doi.org/10.1145/1978582.1978603openalex-snapshot
k-bounded set objects in eventually synchronous distributed systems with churn and continuous accesses
inferred← citeshttps://doi.org/10.2200/s00236ed1v01y201004dct002openalex-snapshot
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed 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.