On the public citation graph

Concurrent Timestamping made simple

https://doi.org/10.1007/bfb0035176
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/978-94-009-7960-4_2openalex-snapshot
Parts I and II
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1109/sfcs.1987.10openalex-snapshot
Bounded time-stamps
inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot
Wait-free synchronization
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/361082.361093openalex-snapshot
A new solution of Dijkstra's concurrent programming problem
inferredcites →https://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
inferredcites →https://doi.org/10.1145/5383.5384openalex-snapshot
The mutual exclusion problem
inferredcites →https://doi.org/10.1145/5383.5385openalex-snapshot
The mutual exclusion problem
inferredcites →https://doi.org/10.1145/93385.93394openalex-snapshot
Atomic snapshots of shared memory
inferredcites →https://doi.org/10.21236/ada213853openalex-snapshot
Bounded Concurrent Time-Stamp Systems Are Constructible
inferredcites →https://doi.org/10.21236/ada222765openalex-snapshot
Atomic Snapshots of Shared Memory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1997.0907openalex-snapshot
Spreading Rumors Rapidly Despite an Adversary
inferred← citeshttps://doi.org/10.1007/3-540-36108-1_8openalex-snapshot
Simple Wait-Free Multireader Registers
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_48openalex-snapshot
A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_3openalex-snapshot
Efficient atomic snapshots using lattice agreement
inferred← citeshttps://doi.org/10.1007/978-0-387-35079-0_2openalex-snapshot
Computer-Assisted Verification of an Algorithm for Concurrent Timestamps
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-540-30186-8_5openalex-snapshot
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
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-35476-2_10openalex-snapshot
Crash Resilient and Pseudo-Stabilizing Atomic Registers
inferred← citeshttps://doi.org/10.1007/bf02242708openalex-snapshot
Bounded time-stamps
inferred← citeshttps://doi.org/10.1007/bf02242714openalex-snapshot
Atomic snapshots using lattice agreement
inferred← citeshttps://doi.org/10.1007/bfb0020429openalex-snapshot
Linear-time snapshot using multi-writer multi-reader registers
inferred← citeshttps://doi.org/10.1007/bfb0055652openalex-snapshot
Checking verifications of protocols and distributed systems by computer
inferred← citeshttps://doi.org/10.1007/s00446-016-0286-7openalex-snapshot
Lower and upper bounds for single-scanner snapshot implementations
inferred← citeshttps://doi.org/10.1007/s00446-025-00478-8openalex-snapshot
Efficient bounded timestamping from standard synchronization primitives
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.06.004openalex-snapshot
Compositional competitiveness for distributed algorithms
inferred← citeshttps://doi.org/10.1109/ipdps.2015.89openalex-snapshot
Stabilizing Byzantine-Fault Tolerant Storage
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365676openalex-snapshot
A theory of competitive analysis for distributed algorithms
inferred← citeshttps://doi.org/10.1137/s0097539790192647openalex-snapshot
Bounded Concurrent Time-Stamping
inferred← citeshttps://doi.org/10.1145/1011767.1011778openalex-snapshot
Efficient synchronous snapshots
inferred← citeshttps://doi.org/10.1145/1132516.1132542openalex-snapshot
Time-space tradeoffs for implementations of snapshots
inferred← citeshttps://doi.org/10.1145/1146381.1146416openalex-snapshot
Single-scanner multi-writer snapshot implementations are fast!
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/164051.164055openalex-snapshot
Atomic snapshots in O(n log n) operations
inferred← citeshttps://doi.org/10.1145/164051.164058openalex-snapshot
Bounded round number
inferred← citeshttps://doi.org/10.1145/177492.177731openalex-snapshot
A bounded first-in, first-enabled solution to the l -exclusion problem
inferred← citeshttps://doi.org/10.1145/234533.234556openalex-snapshot
How to share concurrent wait-free variables
inferred← citeshttps://doi.org/10.1145/237814.237869openalex-snapshot
Modular competitiveness for distributed algorithms
inferred← citeshttps://doi.org/10.1145/248052.248077openalex-snapshot
Spreading rumors rapidly despite an adversary
inferred← citeshttps://doi.org/10.1145/301308.301338openalex-snapshot
Fast, wait-free (2 k -1)-renaming
inferred← citeshttps://doi.org/10.1145/324133.324161openalex-snapshot
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
inferred← citeshttps://doi.org/10.1145/3465084.3467916openalex-snapshot
The Space Complexity of Scannable Binary Objects
inferred← citeshttps://doi.org/10.1145/3583668.3594601openalex-snapshot
Efficient Bounded Timestamping from Standard Synchronization Primitives
inferred← citeshttps://doi.org/10.1145/505241.505246openalex-snapshot
Bounded concurrent timestamp systems using vector clocks
inferred← citeshttps://doi.org/10.1145/571825.571828openalex-snapshot
Space-optimal multi-writer snapshot objects are slow
inferred← citeshttps://doi.org/10.1145/780542.780582openalex-snapshot
A tight time lower bound for space-optimal implementations of multi-writer snapshots
inferred← citeshttps://doi.org/10.48550/arxiv.1103.5794openalex-snapshot
The Space Complexity of Long-lived and One-Shot Timestamp Implementations
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04067openalex-snapshot
Space Bounds for Adaptive Renaming
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.2006.06048openalex-snapshot
Efficient Partial Snapshot Implementations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0202003openalex-snapshot
Simple Optimal Wait-free Multireader Registers
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.