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)

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

(15)

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

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)