On the public citation graph
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations
0 signed · 36 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/inco.1993.1065openalex-snapshot
Bounds on Shared Memory for Mutual Exclusion
inferredcites →https://doi.org/10.1007/3-540-56188-9_7openalex-snapshot
A concurrent time-stamp scheme which is linear in time and space
inferredcites →https://doi.org/10.1007/s00446-007-0042-0openalex-snapshot
Anonymous and fault-tolerant shared-memory computing
inferredcites →https://doi.org/10.1007/s00446-008-0060-6openalex-snapshot
The space complexity of unbounded timestamps
inferredcites →https://doi.org/10.1109/acsc.2001.906616openalex-snapshot
Proceedings 24th Australian Computer Science Conference. ACSC 2001
inferredcites →https://doi.org/10.1109/sfcs.1986.11openalex-snapshot
Atomic shared register access by asynchronous hardware
inferredcites →https://doi.org/10.1109/tse.1987.232564openalex-snapshot
Discarding Obsolete Information in a Replicated Database System
inferredcites →https://doi.org/10.1137/s0097539790192647openalex-snapshot
Bounded Concurrent Time-Stamping
inferredcites →https://doi.org/10.1145/12485.12491openalex-snapshot
Efficient solutions to the replicated log and dictionary problems
inferredcites →https://doi.org/10.1145/153724.153741openalex-snapshot
Atomic snapshots of shared memory
inferredcites →https://doi.org/10.1145/177492.177731openalex-snapshot
A bounded first-in, first-enabled solution to the l -exclusion problem
inferredcites →https://doi.org/10.1145/234533.234556openalex-snapshot
How to share concurrent wait-free variables
inferredcites →https://doi.org/10.1145/290179.290183openalex-snapshot
On the space complexity of randomized synchronization
inferredcites →https://doi.org/10.1145/324133.324161openalex-snapshot
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
inferredcites →https://doi.org/10.1145/358527.358537openalex-snapshot
An optimal algorithm for mutual exclusion in computer networks
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/361082.361093openalex-snapshot
A new solution of Dijkstra's concurrent programming problem
inferredcites →https://doi.org/10.1145/505241.505246openalex-snapshot
Bounded concurrent timestamp systems using vector clocks
inferredcites →https://doi.org/10.1145/59287.59292openalex-snapshot
Distributed FIFO allocation of identical resources using small shared space
inferredcites →https://doi.org/10.1145/62546.62594openalex-snapshot
On achieving consensus using a shared memory
inferredcites →https://doi.org/10.1145/792538.792541openalex-snapshot
Algorithms adapting to point contention
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-662-45174-8_21openalex-snapshot
Space Bounds for Adaptive Renaming
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.tcs.2014.10.013openalex-snapshot
Linear space bootstrap communication schemes
inferred← citeshttps://doi.org/10.1145/2767386.2767403openalex-snapshot
On the Time and Space Complexity of ABA Prevention and Detection
inferred← citeshttps://doi.org/10.1145/2897518.2897565openalex-snapshot
A tight space bound for consensus
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.2200/s00551ed1v01y201311dct012openalex-snapshot
Impossibility Results for Distributed Computing
inferred← citeshttps://doi.org/10.3390/math10152720openalex-snapshot
A Topological Characterization to Arbitrary Resilient Asynchronous Complexity
inferred← citeshttps://doi.org/10.3934/fods.2024008openalex-snapshot
Algebraic topology and distributed computing
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02722openalex-snapshot
On the Time and Space Complexity of ABA Prevention and Detection
inferred← citeshttps://doi.org/10.48550/arxiv.1603.04067openalex-snapshot
Space Bounds for Adaptive Renaming
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.