On the public citation graph

Atomic snapshots using lattice agreement

0 signed · 105 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.1006/jagm.1993.1022openalex-snapshot

Time- and Space-Efficient Randomized Consensus

inferredcites →https://doi.org/10.1007/3-540-56188-9_3openalex-snapshot

Efficient atomic snapshots using lattice agreement

inferredcites →https://doi.org/10.1007/3-540-57271-6_25openalex-snapshot

Linear-time snapshot protocols for unbalanced systems

inferredcites →https://doi.org/10.1007/bf02242703openalex-snapshot

Composite registers

inferredcites →https://doi.org/10.1007/bf02242708openalex-snapshot

Bounded time-stamps

inferredcites →https://doi.org/10.1007/bf02242734openalex-snapshot

Counting networks with arbitrary fan-out

inferredcites →https://doi.org/10.1007/bfb0020429openalex-snapshot

Linear-time snapshot using multi-writer multi-reader registers

inferredcites →https://doi.org/10.1007/bfb0022450openalex-snapshot

Reading many variables in one atomic operation solutions with linear or sublinear complexity

inferredcites →https://doi.org/10.1007/bfb0035175openalex-snapshot

Time-lapse snapshots

inferredcites →https://doi.org/10.1007/bfb0035176openalex-snapshot

Concurrent Timestamping made simple

inferredcites →https://doi.org/10.1016/0196-6774(90)90021-6openalex-snapshot

Fast randomized consensus using shared memory

inferredcites →https://doi.org/10.1109/sfcs.1989.63513openalex-snapshot

Solvability in asynchronous environments

inferredcites →https://doi.org/10.1109/sfcs.1992.267810openalex-snapshot

Randomized consensus in expected O(n log/sup 2/ n) operations per processor

inferredcites →https://doi.org/10.1109/spdp.1991.218190openalex-snapshot

Towards a complexity hierarchy of wait-free concurrent objects

inferredcites →https://doi.org/10.1145/103418.103421openalex-snapshot

Counting networks and multi-processor coordination

inferredcites →https://doi.org/10.1145/112600.112602openalex-snapshot

Randomized wait-free concurrent objects (extended abstract)

inferredcites →https://doi.org/10.1145/112600.112604openalex-snapshot

Resiliency of interactive distributed tasks (extended abstracts)

inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot

Wait-free synchronization

inferredcites →https://doi.org/10.1145/129712.129752openalex-snapshot

Small-depth counting networks

inferredcites →https://doi.org/10.1145/129712.129776openalex-snapshot

Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!

inferredcites →https://doi.org/10.1145/153724.153741openalex-snapshot

Atomic snapshots of shared memory

inferredcites →https://doi.org/10.1145/164051.164055openalex-snapshot

Atomic snapshots in O(n log n) operations

inferredcites →https://doi.org/10.1145/164051.164058openalex-snapshot

Bounded round number

inferredcites →https://doi.org/10.1145/179812.179902openalex-snapshot

Are wait-free algorithms fast?

inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot

On processor coordination using asynchronous hardware

inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot

On achieving consensus using a shared memory

inferredcites →https://doi.org/10.1145/72981.73001openalex-snapshot

Bounded polynomial randomized consensus

inferredcites →https://doi.org/10.1145/73007.73051openalex-snapshot

Bounded concurrrent time-stamp systems are constructible

inferredcites →https://doi.org/10.1145/7531.7533openalex-snapshot

On the minimal synchronism needed for distributed consensus

inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot

Linearizability: a correctness condition for concurrent objects

inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot

An 0(n log n) sorting network

inferredcites →https://doi.org/10.1145/93385.93439openalex-snapshot

Lower bounds for wait-free computation in message-passing systems

inferredcites →https://doi.org/10.1145/97444.97701openalex-snapshot

Wait-free data structures in the asynchronous PRAM model

inferredcites →https://doi.org/10.21236/ada213853openalex-snapshot

Bounded Concurrent Time-Stamp Systems Are Constructible

inferredcites →https://doi.org/10.21236/ada232829openalex-snapshot

Are Wait-Free Algorithms Fast

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-0-387-30162-4_380openalex-snapshot

Snapshots in Shared Memory

inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_380openalex-snapshot

Snapshots in Shared Memory

inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9openalex-snapshot

Stabilization, Safety, and Security of Distributed Systems

inferred← citeshttps://doi.org/10.1007/978-3-030-64348-5_1openalex-snapshot

Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement

inferred← citeshttps://doi.org/10.1007/978-3-031-44274-2_8openalex-snapshot

Exploring Trade-Offs in Partial Snapshot Implementations

inferred← citeshttps://doi.org/10.1007/978-3-032-00347-8_6openalex-snapshot

Byzantine Fault-Tolerant Distributed Set Intersection with Redundancy and Its Relationship with Byzantine Optimization

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_11openalex-snapshot

The F-Snapshot Problem

inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_3openalex-snapshot

How Hard Is It to Take a Snapshot?

inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_12openalex-snapshot

Asynchronous Resilient Linearizability

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-53426-7_21openalex-snapshot

On Composition and Implementation of Sequential Consistency

inferred← citeshttps://doi.org/10.1007/s00446-003-0093-9openalex-snapshot

Condition-based consensus solvability: a hierarchy of conditions and efficient protocols

inferred← citeshttps://doi.org/10.1007/s00446-022-00421-1openalex-snapshot

Asynchronous reconfiguration with Byzantine failures

inferred← citeshttps://doi.org/10.1007/s00446-022-00440-yopenalex-snapshot

Set-Linearizable Implementations from Read/Write Operations: Sets, Fetch &Increment, Stacks and Queues with Multiplicity

inferred← citeshttps://doi.org/10.1007/s004460100067openalex-snapshot

An adaptive collect algorithm with applications

inferred← citeshttps://doi.org/10.1016/b978-0-12-404578-1.00024-3openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/c2011-0-07032-1openalex-snapshot

Distributed Computing Through Combinatorial Topology

inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.06.004openalex-snapshot

Compositional competitiveness for distributed algorithms

inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.08.002openalex-snapshot

The complexity of updating snapshot objects

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.044openalex-snapshot

Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00189-0openalex-snapshot

The time complexity of updating snapshot memories

inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00175-2openalex-snapshot

Balancing networks: State of the art

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00412-6openalex-snapshot

Towards a practical snapshot algorithm

inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00056openalex-snapshot

Synchronous Byzantine Lattice Agreement in O(log(f) Rounds

inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00075openalex-snapshot

Byzantine Generalized Lattice Agreement

inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00113openalex-snapshot

Fault-tolerant Snapshot Objects in Message Passing Systems

inferred← citeshttps://doi.org/10.1109/istcs.1995.377039openalex-snapshot

Towards a practical snapshot algorithm

inferred← citeshttps://doi.org/10.1109/prdc.2005.37openalex-snapshot

Intersecting Sets: a Basic Abstraction for Asynchronous Agreement Problems

inferred← citeshttps://doi.org/10.1109/rtcsa.1998.726426openalex-snapshot

Wait-free snapshots in real-time systems: algorithms and performance

inferred← citeshttps://doi.org/10.1109/sfcs.1994.365676openalex-snapshot

A theory of competitive analysis for distributed algorithms

inferred← citeshttps://doi.org/10.1109/tdsc.2024.3428617openalex-snapshot

Carbon: Scaling Trusted Payments With Untrusted machines

inferred← citeshttps://doi.org/10.1137/s0097539700366000openalex-snapshot

Adaptive and Efficient Algorithms for Lattice Agreement and Renaming

inferred← citeshttps://doi.org/10.1145/1007352.1007406openalex-snapshot

Collective asynchronous reading with polylogarithmic worst-case overhead

inferred← citeshttps://doi.org/10.1145/1011767.1011777openalex-snapshot

Lower bounds for adaptive collect and related objects

inferred← citeshttps://doi.org/10.1145/1281100.1281108openalex-snapshot

Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS

inferred← citeshttps://doi.org/10.1145/1314690.1314694openalex-snapshot

Time lower bounds for implementations of multi-writer snapshots

inferred← citeshttps://doi.org/10.1145/1378533.1378591openalex-snapshot

Partial snapshot objects

inferred← citeshttps://doi.org/10.1145/2332432.2332458openalex-snapshot

Generalized lattice agreement

inferred← citeshttps://doi.org/10.1145/248052.248077openalex-snapshot

Spreading rumors rapidly despite an adversary

inferred← citeshttps://doi.org/10.1145/2597630openalex-snapshot

Tight Bounds for Asynchronous Renaming

inferred← citeshttps://doi.org/10.1145/277697.277705openalex-snapshot

Contention in balancing networks resolved (extended abstract)

inferred← citeshttps://doi.org/10.1145/277697.277749openalex-snapshot

Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)

inferred← citeshttps://doi.org/10.1145/3154273.3154296openalex-snapshot

Set-Constrained Delivery Broadcast

inferred← citeshttps://doi.org/10.1145/3293611.3331632openalex-snapshot

Strongly Linearizable Implementations of Snapshots and Other Types

inferred← citeshttps://doi.org/10.1145/3382734.3405709openalex-snapshot

Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement

inferred← citeshttps://doi.org/10.1145/3465084.3467916openalex-snapshot

The Space Complexity of Scannable Binary Objects

inferred← citeshttps://doi.org/10.1145/3732772.3733529openalex-snapshot

Tight Bounds on Channel Reliability via Generalized Quorum Systems

inferred← citeshttps://doi.org/10.1145/3732772.3733540openalex-snapshot

Brief Announcement: Fast Atomic Snapshot and Asynchronous Latency

inferred← citeshttps://doi.org/10.1145/3732772.3733545openalex-snapshot

Brief Announcement: Stranger-Free Tasks

inferred← citeshttps://doi.org/10.1145/383962.384006openalex-snapshot

A hierarchy of conditions for consensus solvability

inferred← citeshttps://doi.org/10.2200/s01165ed1v01y202202dct018openalex-snapshot

Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions

inferred← citeshttps://doi.org/10.23919/acc60939.2024.10645007openalex-snapshot

Network Preference Dynamics Using Lattice Theory

inferred← citeshttps://doi.org/10.3844/jcssp.2020.402.421openalex-snapshot

On the Construction and Properties of Lattice-Group Structure in Cartesian Product Spaces

inferred← citeshttps://doi.org/10.4230/lipics.disc.2019.29openalex-snapshot

Byzantine Approximate Agreement on Graphs

inferred← citeshttps://doi.org/10.4230/lipics.opodis.2019.29openalex-snapshot

Linearizable Replicated State Machines With Lattice Agreement

inferred← citeshttps://doi.org/10.4230/lipics.opodis.2019.31openalex-snapshot

Reconfigurable Lattice Agreement and Applications

inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.13openalex-snapshot

Relaxed Queues and Stacks from Read/Write Operations

inferred← citeshttps://doi.org/10.4230/lipics.opodis.2020.4openalex-snapshot

Byzantine Lattice Agreement in Asynchronous Systems

inferred← citeshttps://doi.org/10.48550/arxiv.1502.02991openalex-snapshot

Simple Executions of Snapshot Implementations

inferred← citeshttps://doi.org/10.48550/arxiv.1510.02211openalex-snapshot

The F-snapshot Problem

inferred← citeshttps://doi.org/10.48550/arxiv.1607.05596openalex-snapshot

On Composition and Implementation of Sequential Consistency (Extended Version)

inferred← citeshttps://doi.org/10.48550/arxiv.1908.10826openalex-snapshot

Strongly Linearizable Implementations of Snapshots and Other Types

inferred← citeshttps://doi.org/10.48550/arxiv.2001.02670openalex-snapshot

Synchronous Byzantine Lattice Agreement in ${\cal O}(\log (f))$ Rounds

inferred← citeshttps://doi.org/10.48550/arxiv.2001.04235openalex-snapshot

Notes on Theory of Distributed Systems

inferred← citeshttps://doi.org/10.48550/arxiv.2008.11837openalex-snapshot

Amortized Constant Round Atomic Snapshot in Message-Passing Systems

inferred← citeshttps://doi.org/10.48550/arxiv.2105.04909openalex-snapshot

Accountability and Reconfiguration: Self-Healing Lattice Agreement

inferred← citeshttps://doi.org/10.5075/epfl-thesis-5447openalex-snapshot

Randomized versus Deterministic Implementations of Concurrent Data Structures

inferred← citeshttps://doi.org/10.70675/0bfdc711z1229z4d86z99bdzb08f347a79feopenalex-snapshot

Scalable and Reliable Decentralized Computing : From Asset Transfer to Atomic Snapshot

inferred← citeshttps://doi.org/10.70675/622ef5b0zb664z4e5czbe30z3348c766562dopenalex-snapshot

Revisiting weighted quorums and asynchronous reconfiguration for atomic storage

inferred← citeshttps://doi.org/10.70675/9c25b337z7b59z4d69z8a2azf1601341b9c0openalex-snapshot

Achieving accountability, reconfiguration, randomness, and secret leadership in byzantine fault tolerant 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.