On the public citation graph
A new fast-path mechanism for mutual exclusion
0 signed · 27 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.1007/3-540-40026-5_2openalex-snapshot
Adaptive Mutual Exclusion with Local Spinning
inferredcites →https://doi.org/10.1007/3-540-48169-9_13openalex-snapshot
Fast and Scalable Mutual Exclusion
inferredcites →https://doi.org/10.1007/bf01784242openalex-snapshot
A fast, scalable mutual exclusion algorithm
inferredcites →https://doi.org/10.1007/bf02283567openalex-snapshot
Adaptive solutions to the mutual exclusion problem
inferredcites →https://doi.org/10.1007/s00446-006-0009-6openalex-snapshot
Adaptive mutual exclusion with local spinning
inferredcites →https://doi.org/10.1016/0020-0190(93)90015-2openalex-snapshot
Speeding Lamport's fast mutual exclusion algorithm
inferredcites →https://doi.org/10.1016/0167-6423(95)00009-hopenalex-snapshot
Wait-free algorithms for fast, long-lived renaming
inferredcites →https://doi.org/10.1109/2.55501openalex-snapshot
Synchronization algorithms for shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/71.80120openalex-snapshot
The performance of spin lock alternatives for shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/215399.215434openalex-snapshot
The communication requirements of mutual exclusion
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4183openalex-snapshot
Fast mutual exclusion by the Triangle algorithm
inferred← citeshttps://doi.org/10.1007/11823285_56openalex-snapshot
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_24openalex-snapshot
Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_3openalex-snapshot
Timing-Based Mutual Exclusion with Local Spinning
inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_19openalex-snapshot
RMR-Efficient Randomized Abortable Mutual Exclusion
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-006-0003-zopenalex-snapshot
Nonatomic mutual exclusion with local spinning
inferred← citeshttps://doi.org/10.1007/s00446-006-0009-6openalex-snapshot
Adaptive mutual exclusion with local spinning
inferred← citeshttps://doi.org/10.1007/s00446-019-00364-0openalex-snapshot
Recoverable mutual exclusion
inferred← citeshttps://doi.org/10.1145/2145816.2145835openalex-snapshot
A methodology for creating fast wait-free data structures
inferred← citeshttps://doi.org/10.1145/2370036.2145835openalex-snapshot
A methodology for creating fast wait-free data structures
inferred← citeshttps://doi.org/10.1145/571825.571827openalex-snapshot
Nonatomic mutual exclusion with local spinning
inferred← citeshttps://doi.org/10.11575/prism/27292openalex-snapshot
Performance Comparison of Randomized and Deterministic Mutual Exclusion Algorithms
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.