WDAG 1990 International Workshop on Distributed Algorithms
 |  |
Wall of Fame | Most Viewed WDAG-1990 Paper
WDAG
1990
Springer
13 years 8 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 80 | ||
| 2 | | 72 | ||
| 3 | | 62 |