tight bounds for k-set agreement with limited-scope failure detectors

Authors:
Maurice Herlihy;Lucia Draque Penso
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI
Venue:
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Year:
2003

Agreement is harder than consensus: set consensus problems in totally asynchronous systems

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Unifying synchronous and asynchronous message-passing models

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability

Journal of the ACM (JACM)
k-set agreement with limited accuracy failure detectors

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing

Hi-index	0.00