On the public citation graph
Fast, long-lived renaming
0 signed · 24 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.1109/sfcs.1987.5openalex-snapshot
Achievable cases in an asynchronous environment
inferredcites →https://doi.org/10.1145/164051.164056openalex-snapshot
Immediate atomic snapshots and fast renaming
inferredcites →https://doi.org/10.1145/167088.167125openalex-snapshot
The asynchronous computability theorem for t -resilient tasks
inferredcites →https://doi.org/10.1145/197917.198073openalex-snapshot
Using k-exclusion to implement resilient, scalable shared objects (extended abstract)
inferredcites →https://doi.org/10.1145/72981.73003openalex-snapshot
Shared-memory vs. message-passing in an asynchronous distributed environment
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-45414-4_9openalex-snapshot
Adaptive Long-lived O(k 2)-Renaming with O(k 2) Steps
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_12openalex-snapshot
On the Importance of Registers for Computability
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-642-15763-9_9openalex-snapshot
Fast Randomized Test-and-Set and Renaming
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_17openalex-snapshot
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less
inferred← citeshttps://doi.org/10.1007/bfb0056480openalex-snapshot
Long-lived, fast, waitfree renaming with optimal name space and high throughput
inferred← citeshttps://doi.org/10.1007/s00446-003-0088-6openalex-snapshot
Shared-memory mutual exclusion: major research trends since 1986
inferred← citeshttps://doi.org/10.1007/s00446-019-00349-zopenalex-snapshot
Efficient randomized test-and-set implementations
inferred← citeshttps://doi.org/10.1007/s004460050039openalex-snapshot
Using local-spin k -exclusion algorithms to improve wait-free object implementations
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00009-hopenalex-snapshot
Wait-free algorithms for fast, long-lived renaming
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.030openalex-snapshot
Agreeing within a few writes
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181946openalex-snapshot
A simple algorithmic characterization of uniform solvability
inferred← citeshttps://doi.org/10.1145/197917.198073openalex-snapshot
Using k-exclusion to implement resilient, scalable shared objects (extended abstract)
inferred← citeshttps://doi.org/10.1145/1993806.1993850openalex-snapshot
Optimal-time adaptive strong renaming, with applications to counting
inferred← citeshttps://doi.org/10.1145/2332432.2332436openalex-snapshot
On the time and space complexity of randomized test-and-set
inferred← citeshttps://doi.org/10.48550/arxiv.1902.04002openalex-snapshot
Efficient Randomized Test-And-Set Implementations
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.