On the public citation graph

Long-lived, fast, waitfree renaming with optimal name space and high throughput

https://doi.org/10.1007/bfb0056480
0 signed · 38 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/3-540-56188-9_6openalex-snapshot
Wait-free test-and-set
inferredcites →https://doi.org/10.1007/3-540-58325-4_169openalex-snapshot
Randomized wait-free naming
inferredcites →https://doi.org/10.1007/bfb0020430openalex-snapshot
Fast, long-lived renaming
inferredcites →https://doi.org/10.1007/bfb0056480openalex-snapshot
Long-lived, fast, waitfree renaming with optimal name space and high throughput
inferredcites →https://doi.org/10.1145/114005.102808openalex-snapshot
Wait-free synchronization
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/224964.224986openalex-snapshot
Long-lived renaming made fast
inferredcites →https://doi.org/10.1145/248052.248078openalex-snapshot
Fast, long-lived renaming improved and simplified
inferredcites →https://doi.org/10.1145/277697.277749openalex-snapshot
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
inferredcites →https://doi.org/10.1145/72981.72991openalex-snapshot
The ambiguity of choosing
inferredcites →https://doi.org/10.1145/78969.78972openalex-snapshot
Linearizability: a correctness condition for concurrent objects
inferredcites →https://doi.org/10.1145/79147.79158openalex-snapshot
Renaming in an asynchronous 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/978-3-030-39442-4_29openalex-snapshot
Naming Anonymous Processes Using an Optimal Number of Test-and-Set Registers
inferred← citeshttps://doi.org/10.1007/978-3-030-63089-8_10openalex-snapshot
Performance of Test-and-Set Algorithms for Naming Anonymous Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-14472-6_27openalex-snapshot
Space- and Time-Efficient Long-Lived Test-And-Set Objects
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-41527-2_4openalex-snapshot
An $O(\sqrt n)$ Space Bound for Obstruction-Free Leader Election
inferred← citeshttps://doi.org/10.1007/pl00008922openalex-snapshot
A decision-theoretic approach to reliable message delivery
inferred← citeshttps://doi.org/10.1007/s00446-019-00349-zopenalex-snapshot
Efficient randomized test-and-set implementations
inferred← citeshttps://doi.org/10.1007/s004460200071openalex-snapshot
Randomized two-process wait-free test-and-set
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.01.002openalex-snapshot
Randomized renaming in shared memory systems
inferred← citeshttps://doi.org/10.1109/focs.2011.66openalex-snapshot
The Complexity of Renaming
inferred← citeshttps://doi.org/10.1109/ipdps.2015.77openalex-snapshot
Randomized Renaming in Shared Memory Systems
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.1145/2484239.2484240openalex-snapshot
Randomized loose renaming in o (log log n ) time
inferred← citeshttps://doi.org/10.1145/2597630openalex-snapshot
Tight Bounds for Asynchronous Renaming
inferred← citeshttps://doi.org/10.1145/2746539.2746627openalex-snapshot
Test-and-Set in Optimal Space
inferred← citeshttps://doi.org/10.11575/prism/32406openalex-snapshot
An Almost Tight Lower Bound for Abortable Leader Election
inferred← citeshttps://doi.org/10.4230/lipics.disc.2018.21openalex-snapshot
An Almost Tight RMR Lower Bound for Abortable Test-And-Set
inferred← citeshttps://doi.org/10.48550/arxiv.1512.09314openalex-snapshot
Asynchronous Exclusive Selection
inferred← citeshttps://doi.org/10.48550/arxiv.1608.06033openalex-snapshot
Deterministic and Fast Randomized Test-and-Set in Optimal Space
inferred← citeshttps://doi.org/10.48550/arxiv.1902.04002openalex-snapshot
Efficient Randomized Test-And-Set Implementations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9909015openalex-snapshot
A decision-theoretic approach to reliable message delivery
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5447openalex-snapshot
Randomized versus Deterministic Implementations of Concurrent Data Structures
showing the first 23 of 24 · page through all 24
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.