# The choice coordination problem

@article{Rabin1982TheCC,
title={The choice coordination problem},
author={Michael O. Rabin},
journal={Acta Informatica},
year={1982},
volume={17},
pages={121-134}
}
In the course of a concurrent computation, processes P1,..., Pn must reach a common choice of one out of k alternatives A 1,..., A k. They do this by protocols using k shared variables, one for each alternative. If the range of the variables has m values then $$\frac{{\text{1}}}{{\text{2}}}\sqrt[{\text{3}}]{n} \leqq \operatorname{m}$$ is necessary, and n + 2≦m is sufficient, for deterministic protocols solving the choice coordination problem (C.C.P.). We introduce very simple randomizing… CONTINUE READING

#### Citations

##### Publications citing this paper.
Showing 1-10 of 62 extracted citations
Highly Influenced
5 Excerpts
Highly Influenced
3 Excerpts
2 Excerpts

#### References

##### Publications referenced by this paper.
Showing 1-4 of 4 references

## Experimental control of ear choice in the moth ear mite

• A. Treat
• XI. Internationaler Kongress ftir Entomologie…
• 1960

## Concurrent search of a large datastructure

• M. Ben-Or, M. Fischer, M. O. Rabin