On the public citation graph
The choice coordination problem
0 signed · 93 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.1980.26openalex-snapshot
N-process synchronization by 4.log2N-valued shared variable
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11916246_15openalex-snapshot
Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_36openalex-snapshot
Probabilistic bidding gives optimal distributed resource allocation
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_83openalex-snapshot
On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_20openalex-snapshot
Games, Probability, and the Quantitative μ-Calculus qMμ
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_6openalex-snapshot
Parameterized Verification by Probabilistic Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_13openalex-snapshot
Randomized Non-sequential Processes
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_15openalex-snapshot
Automatic Verification of Probabilistic Free Choice
inferred← citeshttps://doi.org/10.1007/3-540-56188-9_4openalex-snapshot
Choice coordination with multiple alternatives (preliminary version)
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_169openalex-snapshot
Randomized wait-free naming
inferred← citeshttps://doi.org/10.1007/978-3-030-05529-5_9openalex-snapshot
Anonymity in Distributed Read/Write Systems: An Introductory Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_20openalex-snapshot
Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects
inferred← citeshttps://doi.org/10.1007/978-3-319-73721-8_16openalex-snapshot
$$P^5$$ : Planner-less Proofs of Probabilistic Parameterized Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-94460-9_10openalex-snapshot
Confluence and Convergence in Probabilistically Terminating Reduction Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_16openalex-snapshot
Probabilistic CTL $$^{*}$$ : The Deductive Way
inferred← citeshttps://doi.org/10.1007/bf01558664openalex-snapshot
Choice coordination with limited failure
inferred← citeshttps://doi.org/10.1007/bf01843570openalex-snapshot
Verification of multiprocess probabilistic protocols
inferred← citeshttps://doi.org/10.1007/bf02283568openalex-snapshot
Naming symmetric processes using shared variables
inferred← citeshttps://doi.org/10.1007/bfb0036903openalex-snapshot
Symmetric and economical solutions to the mutual exclusion problem in a distributed system
inferred← citeshttps://doi.org/10.1007/bfb0036917openalex-snapshot
Concurrent probabilistic program, or: How to schedule if you must
inferred← citeshttps://doi.org/10.1007/s00446-003-0091-yopenalex-snapshot
Hundreds of impossibility results for distributed computing
inferred← citeshttps://doi.org/10.1007/s004460050045openalex-snapshot
Randomized naming using wait-free shared variables
inferred← citeshttps://doi.org/10.1007/s004460200071openalex-snapshot
Randomized two-process wait-free test-and-set
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90094-eopenalex-snapshot
Space efficient processor identity protocol
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90103-5openalex-snapshot
The processor identity problem
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90010-1openalex-snapshot
N-Process mutual exclusion with bounded waiting by 4 · Log2 N-valued shared variable
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90086-copenalex-snapshot
An introduction to randomized algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90118-xopenalex-snapshot
Symmetric and economical solutions to the mutual exclusion problem in a distributed system
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90031-xopenalex-snapshot
On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90206-hopenalex-snapshot
Global and local views of state fairness
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90004-2openalex-snapshot
Symmetry breaking in distributed networks
inferred← citeshttps://doi.org/10.1016/j.cl.2004.02.006openalex-snapshot
Model checking and abstraction to the aid of parameterized systems (a survey)
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105938openalex-snapshot
Mutual exclusion in fully anonymous shared memory systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.09.007openalex-snapshot
Task-structured probabilistic I/O automata
inferred← citeshttps://doi.org/10.1016/j.scico.2013.08.006openalex-snapshot
Reasoning about almost-certain convergence properties using Event-B
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.027openalex-snapshot
Leader-based de-anonymization of an anonymous read/write memory
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91022-1openalex-snapshot
Reasoning with time and chance
inferred← citeshttps://doi.org/10.1016/s1084-8045(00)90014-6openalex-snapshot
A coordination framework and architecture for internet groupware
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80600-0openalex-snapshot
Reasoning about efficiency within a probabilistic μ-calculus
inferred← citeshttps://doi.org/10.1037/0000114-016openalex-snapshot
Where are we now, and where do we go from here?
inferred← citeshttps://doi.org/10.1109/100.755814openalex-snapshot
Distributing identity [symmetry breaking distributed access protocols]
inferred← citeshttps://doi.org/10.1109/eurmic.2000.874416openalex-snapshot
A coordination architecture for Internet groupwork
inferred← citeshttps://doi.org/10.1109/sfcs.1981.41openalex-snapshot
Symmetry breaking in distributive networks
inferred← citeshttps://doi.org/10.1109/sfcs.1983.12openalex-snapshot
Decision procedures for time and chance
inferred← citeshttps://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferred← citeshttps://doi.org/10.1109/sfcs.1987.5openalex-snapshot
Achievable cases in an asynchronous environment
inferred← citeshttps://doi.org/10.1109/spdp.1990.143625openalex-snapshot
Solving the processor identity problem in O(n) space
inferred← citeshttps://doi.org/10.1109/wodes.2006.1678432openalex-snapshot
Task-Structured Probabilistic I/O Automata
inferred← citeshttps://doi.org/10.1137/0214070openalex-snapshot
Concurrent Probabilistic Programs, Or: How to Schedule If You Must
inferred← citeshttps://doi.org/10.1137/s0097539790192635openalex-snapshot
Wait-Free Consensus Using Asynchronous Hardware
inferred← citeshttps://doi.org/10.1137/s0097539795294979openalex-snapshot
Solvability in Asynchronous Environments II: Finite Interactive Tasks
inferred← citeshttps://doi.org/10.1145/1182613.1182616openalex-snapshot
Results on the quantitative μ-calculus qM μ
inferred← citeshttps://doi.org/10.1145/129712.129742openalex-snapshot
Efficient program transformations for resilient parallel computation via randomization (preliminary version)
inferred← citeshttps://doi.org/10.1145/177492.177724openalex-snapshot
Reasoning about probabilistic parallel programs
inferred← citeshttps://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program
inferred← citeshttps://doi.org/10.1145/229542.229547openalex-snapshot
Probabilistic predicate transformers
inferred← citeshttps://doi.org/10.1145/2993.357244openalex-snapshot
Real-Time Synchronization of Interprocess Communications
inferred← citeshttps://doi.org/10.1145/3087801.3087807openalex-snapshot
Coordination Without Prior Agreement
inferred← citeshttps://doi.org/10.1145/323596.323598openalex-snapshot
Symmetry and similarity in distributed systems
inferred← citeshttps://doi.org/10.1145/3293611.3331594openalex-snapshot
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
inferred← citeshttps://doi.org/10.1145/3335772.3335938openalex-snapshot
The mutual exclusion problem: part II---Statement and solutions
inferred← citeshttps://doi.org/10.1145/3743642.3743652openalex-snapshot
Invited paper: Full Anonymity in Read/Write and Read/Modify/Write Distributed Computing
inferred← citeshttps://doi.org/10.1145/3776651openalex-snapshot
Probabilistic Concurrent Reasoning in Outcome Logic: Independence, Conditioning, and Invariants
inferred← citeshttps://doi.org/10.1145/41840.41848openalex-snapshot
On processor coordination using asynchronous hardware
inferred← citeshttps://doi.org/10.1145/582153.582154openalex-snapshot
Termination of probabilistic concurrent programs
inferred← citeshttps://doi.org/10.1145/582153.582159openalex-snapshot
Unbounded speed variability in distributed communication systems
inferred← citeshttps://doi.org/10.1145/72981.72982openalex-snapshot
A hundred impossibility proofs for distributed computing
inferred← citeshttps://doi.org/10.1145/79147.79158openalex-snapshot
Renaming in an asynchronous environment
inferred← citeshttps://doi.org/10.1145/800057.808691openalex-snapshot
On maintaining dynamic information in a concurrent environment
inferred← citeshttps://doi.org/10.1145/800061.808757openalex-snapshot
On the extremely fair treatment of probabilistic algorithms
inferred← citeshttps://doi.org/10.1145/800076.802467openalex-snapshot
Distributed algorithms for synchronizing interprocess communication within real time
inferred← citeshttps://doi.org/10.1145/800220.806685openalex-snapshot
Real time resource allocation in distributed systems
inferred← citeshttps://doi.org/10.1145/800222.806732openalex-snapshot
Verification of multiprocess probabilistic protocols
inferred← citeshttps://doi.org/10.1145/800222.806740openalex-snapshot
Asynchronous Byzantine consensus
inferred← citeshttps://doi.org/10.1145/93385.93427openalex-snapshot
Reasoning about probabilistic algorithms
inferred← citeshttps://doi.org/10.2200/s00845ed1v01y201804dct014openalex-snapshot
Distributed Computing Pearls
inferred← citeshttps://doi.org/10.2200/s01165ed1v01y202202dct018openalex-snapshot
Concurrent Crash-Prone Shared Memory Systems: A Few Theoretical Notions
inferred← citeshttps://doi.org/10.25949/19430699openalex-snapshot
Algebraic verification of probabilistic and concurrent systems
inferred← citeshttps://doi.org/10.3929/ethz-a-006154359openalex-snapshot
Tool support for qualitative reasoning in event-B
inferred← citeshttps://doi.org/10.3929/ethz-a-006819465openalex-snapshot
Development of Rabin’s Choice Coordination Algorithm in Event-B
inferred← citeshttps://doi.org/10.3929/ethz-a-009911716openalex-snapshot
Proving almost-certain convergence properties using event-B
inferred← citeshttps://doi.org/10.4204/eptcs.28.9openalex-snapshot
An expectation transformer approach to predicate abstraction and data independence for probabilistic programs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7153openalex-snapshot
Weak Concurrent Kleene Algebra with Application to Algebraic Verification
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0309024openalex-snapshot
Results on the quantitative mu-calculus qMu
inferred← citeshttps://doi.org/10.55041/ijsrem29532openalex-snapshot
Instruction Level Parallelism and Memory Synchronization
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.