The choice coordination problem

DOI10.1007/BF00288965MaRDI QIDQ1162148zbMATH OpenFDO

Authors Michael O. Rabin

Publication date 1982

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00288965

zbMATH Keywords

concurrent computationrandomizing protocols

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Cited in

(17)

• Verification of multiprocess probabilistic protocols
• On the complexity of deciding fair termination of probabilistic concurrent finite-state programs
• An introduction to randomized algorithms
• Symmetric and economical solutions to the mutual exclusion problem in a distributed system
• Task-structured probabilistic I/O automata
• Model checking and abstraction to the aid of parameterized systems (a survey)
• Leader-based de-anonymization of an anonymous read/write memory
• Mutual exclusion in fully anonymous shared memory systems
• Naming symmetric processes using shared variables
• Randomized two-process wait-free test-and-set
• Hundreds of impossibility results for distributed computing
• Denotational semantics for probabilistic and concurrent programs
• What is the minimum number of random bits required for computabilityokula and efficiency in anonymous networks?
• Global and local views of state fairness
• Space efficient processor identity protocol
• The processor identity problem
• Symmetry breaking in distributed networks

This page was built for publication: The choice coordination problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162148)