Name
Abstract | ||
|---|---|---|
We present networks of bounded degree and a fully polynomial almost everywhere agreementscheme which tolerate, with high probability, randomly located faulty processors, whereprocessors fail independently with some constant probability.1 IntroductionDwork et. al. [DPPU] introduced the notion of almost everywhere agreement. They exhibiteda communication network of bounded degree connecting N processors along with a polynomialprotocol enabling all but O(t) of the correct processors to... |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1016/0020-0190(96)00015-4 | Inf. Process. Lett. |
Keywords | Field | DocType |
bounded degree,distributed computing,fault tolerance,agreement,fault tolerant | Discrete mathematics,Combinatorics,Polynomial,Almost everywhere,Distributed algorithm,Probability distribution,Fault tolerance,Mathematics,Bounded function | Journal |
Volume | Issue | ISSN |
57 | 6 | 0020-0190 |
Citations | PageRank | References |
5 | 0.48 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Ben-Or | 1 | 2008 | 420.97 |
| Dana Ron | 2 | 3164 | 342.97 |