Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The choice coordination problem

From MaRDI portal
Publication:1162148
Jump to:navigation, search

DOI10.1007/BF00288965zbMath0479.68048MaRDI QIDQ1162148

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)


Related Items

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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1162148&oldid=13224263"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:42.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki