Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Achieving independence in logarithmic number of rounds
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
On the complexity of computation in the presence of link failures: the case of a ring
Distributed Computing
| Hi-index | 0.00 |
The news media often bombards the public with forecasts of election results. Polls predict, sometimes years in advance; exit polls are more accurate, and unofficial tallies tend to be closer to the final results. If close elections are disputed, it may take the courts weeks to determine the actual outcome of an election. If the election is nearly unanimous, however, a few disputed votes can have no outcome on the final results. The time at which the final results may be known with certainty thus depends upon the accuracy of the forecast (the number of disputed votes), and the closeness of the election.