On the public citation graph
Arbitration without common modifiable variables
0 signed · 63 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/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1016/0020-0190(81)90106-xopenalex-snapshot
Myths about 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.1002/cpe.3263openalex-snapshot
High‐performanceN‐thread software solutions for mutual exclusion
inferred← citeshttps://doi.org/10.1002/cpe.3659openalex-snapshot
Dekker's mutual exclusion algorithm made RW‐safe
inferred← citeshttps://doi.org/10.1002/cpe.4183openalex-snapshot
Fast mutual exclusion by the Triangle algorithm
inferred← citeshttps://doi.org/10.1006/inco.1996.0034openalex-snapshot
Contention-Free Complexity of Shared Memory Algorithms
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/3-540-56188-9_21openalex-snapshot
The granularity of waiting (extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_97openalex-snapshot
Threshold graphs and synchronization protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-20002-1_5openalex-snapshot
Load and Store Based Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-03077-7_17openalex-snapshot
Synthesizing, Correcting and Improving Code, Using Model Checking-Based Genetic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-39989-6_10openalex-snapshot
Automatic Discovery of Mutual Exclusion Algorithms
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-540-88387-6_5openalex-snapshot
Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_20openalex-snapshot
Compositional Strategy Mapping
inferred← citeshttps://doi.org/10.1007/978-3-642-15898-8_12openalex-snapshot
A Study of Shared-Memory Mutual Exclusion Protocols Using CADP
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/978-3-642-46604-5_3openalex-snapshot
Derivation of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/bf01179373openalex-snapshot
A fine-grained solution to the mutual exclusion problem
inferred← citeshttps://doi.org/10.1007/bf01407858openalex-snapshot
Initializing memory shared by several processors
inferred← citeshttps://doi.org/10.1007/bf01784242openalex-snapshot
A fast, scalable mutual exclusion algorithm
inferred← citeshttps://doi.org/10.1007/bfb0056497openalex-snapshot
Deriving a scalable algorithm for mutual exclusion
inferred← citeshttps://doi.org/10.1007/s00165-016-0407-xopenalex-snapshot
Tournaments for mutual exclusion: verification and concurrent complexity
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-019-00364-0openalex-snapshot
Recoverable mutual exclusion
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/s10009-016-0418-1openalex-snapshot
Synthesizing, correcting and improving code, using model checking-based genetic programming
inferred← citeshttps://doi.org/10.1016/j.scico.2012.01.003openalex-snapshot
Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.030openalex-snapshot
A visit to mutual exclusion in seven dates
inferred← citeshttps://doi.org/10.1109/fmcad.2015.7542261openalex-snapshot
Pattern-based synthesis of synchronization for the C++ memory model
inferred← citeshttps://doi.org/10.1145/1281421.1281423openalex-snapshot
Ordering of events in two-process concurrent system
inferred← citeshttps://doi.org/10.1145/1317471.1317473openalex-snapshot
On the correctness issues in two-process mutual exclusion algorithms
inferred← citeshttps://doi.org/10.1145/1515698.1515711openalex-snapshot
Book review of synchronization algorithms and concurrent programming by Gadi Taubenfeld (Pearson/Prentice Hall, 2006)
inferred← citeshttps://doi.org/10.1145/164051.164072openalex-snapshot
Fast, scalable synchronization with minimal hardware support
inferred← citeshttps://doi.org/10.1145/197917.197953openalex-snapshot
Contention---free complexity of shared memory algorithms
inferred← citeshttps://doi.org/10.1145/3087801.3087819openalex-snapshot
Recoverable Mutual Exclusion in Sub-logarithmic Time
inferred← citeshttps://doi.org/10.1145/3158119openalex-snapshot
Data-centric dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/3212734.3212755openalex-snapshot
Recoverable Mutual Exclusion Under System-Wide Failures
inferred← citeshttps://doi.org/10.1145/3360550openalex-snapshot
Value-centric dynamic partial order reduction
inferred← citeshttps://doi.org/10.1145/571825.571827openalex-snapshot
Nonatomic mutual exclusion with local spinning
inferred← citeshttps://doi.org/10.1145/872035.872080openalex-snapshot
Automatic discovery of mutual exclusion algorithms
inferred← citeshttps://doi.org/10.2200/s00845ed1v01y201804dct014openalex-snapshot
Distributed Computing Pearls
inferred← citeshttps://doi.org/10.3390/a17120536openalex-snapshot
Verifying Mutual Exclusion Algorithms with Non-Atomic Registers
inferred← citeshttps://doi.org/10.3390/a18040226openalex-snapshot
Proving Properties of Dekker’s Algorithm for Mutual Exclusion of N Processes
inferred← citeshttps://doi.org/10.3390/computers13060133openalex-snapshot
Modeling and Analysis of Dekker-Based Mutual Exclusion Algorithms
inferred← citeshttps://doi.org/10.3390/computers15030196openalex-snapshot
Black-White Bakery Algorithm Made RW-Safe
inferred← citeshttps://doi.org/10.3390/math12162443openalex-snapshot
Formal Modeling and Verification of Lycklama and Hadzilacos’s Mutual Exclusion Algorithm
inferred← citeshttps://doi.org/10.3390/modelling5030037openalex-snapshot
Correctness Verification of Mutual Exclusion Algorithms by Model Checking
inferred← citeshttps://doi.org/10.3934/aci.2024005openalex-snapshot
Property assessment of Peterson's mutual exclusion algorithms
inferred← citeshttps://doi.org/10.3934/aci.2025014openalex-snapshot
Formal verification of mutual exclusion algorithms in anonymous memory
inferred← citeshttps://doi.org/10.4204/eptcs.140.5openalex-snapshot
Synthesis of Parametric Programs using Genetic Programming and Model Checking
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.