On the public citation graph

A fine-grained solution to the mutual exclusion problem

https://doi.org/10.1007/bf01179373
0 signed · 29 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.1006/inco.1993.1065openalex-snapshot
Bounds on Shared Memory for Mutual Exclusion
inferredcites →https://doi.org/10.1007/bf00288966openalex-snapshot
Arbitration without common modifiable variables
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot
Myths about the mutual exclusion problem
inferredcites →https://doi.org/10.1016/0020-0190(88)90171-8openalex-snapshot
Atomic semantics of nonatomic programs
inferredcites →https://doi.org/10.1145/103727.103729openalex-snapshot
Algorithms for scalable synchronization on shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/357195.357199openalex-snapshot
A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
inferredcites →https://doi.org/10.1145/357980.357989openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/365559.365617openalex-snapshot
Solution of a problem in concurrent programming control
inferredcites →https://doi.org/10.1145/5383.5385openalex-snapshot
The mutual exclusion problem

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1996.0006openalex-snapshot
Time/Contention Trade-Offs for Multiprocessor Synchronization
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_605openalex-snapshot
Mellor-Crummey and Scott Mutual Exclusion Algorithm
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-642-27848-8_605-1openalex-snapshot
Mellor-Crummey and Scott Mutual Exclusion Algorithm
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/bf01784242openalex-snapshot
A fast, scalable mutual exclusion algorithm
inferred← citeshttps://doi.org/10.1007/s00236-011-0132-0openalex-snapshot
Nonatomic dual bakery algorithm with bounded tokens
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-026-00512-3openalex-snapshot
On the notions of bounded bypass, and how to make any deadlock-free MUTEX protocol satisfy one of them
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/b978-0-12-415917-4.00017-7openalex-snapshot
Multicore Software Development for Embedded Systems
inferred← citeshttps://doi.org/10.1109/icdcs.2005.83openalex-snapshot
Transformations of Mutual Exclusion Algorithms from the Cache-Coherent Model to the Distributed Shared Memory Model
inferred← citeshttps://doi.org/10.1137/070686445openalex-snapshot
An $O(1)$ RMRs Leader Election Algorithm
inferred← citeshttps://doi.org/10.1145/1146381.1146417openalex-snapshot
An O (1) RMRs leader election algorithm
inferred← citeshttps://doi.org/10.1145/164051.164072openalex-snapshot
Fast, scalable synchronization with minimal hardware support
inferred← citeshttps://doi.org/10.1145/195058.195139openalex-snapshot
Time bounds for mutual exclusion and related problems
inferred← citeshttps://doi.org/10.1145/571825.571827openalex-snapshot
Nonatomic mutual exclusion with local spinning
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.