On the decidability of distributed decision tasks

Authors:
Maurice Herlihy;Sergio Rajsbaum
Affiliations:
Computer Science Department, Brown University, Providence, RI;Instituto de Matemáticas- U.N.A.M., C.U., D.F. 04510, México
Venue:
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Year:
1996

Citing 3
Cited 1

A combinatorial characterization of the distributed 1-solvable tasks

Journal of Algorithms
3-processor tasks are undecidable

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Some Results on the Impossibility, Universality, and Decidability of Consensus

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms

The decidability of distributed decision tasks (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract