The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Impossibility of distributed consensus with one faulty process
The work
| Authors | Michael J. Fischer; Nancy A. Lynch; Michael S. Paterson |
|---|---|
| Editors | |
| Type | inproceedings |
| Year | 1983 |
| Citekey | fischer1983impossibility |
Where it appeared
| Published in | Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems |
|---|---|
| Publisher | ACM Press |
| Pages | 1 |
Identifiers
| DOI | 10.1145/588058.588060 |
|---|---|
| OpenAlex | W2103814941 |
Access
| Landing page | https://doi.org/10.1145/588058.588060 |
|---|---|
| Free full text | https://dl.acm.org/doi/pdf/10.1145/588058.588060 |
Empty on purpose
| copy |
Related
| Distinct from | fischer1985impossibility |
|---|
Abstract
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the "Byzantine Generals" problem.
How it got here
| How it got here | agent via unpaywall |
|---|---|
| Added | 2026-08-23 00:00 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Filed under
Cite it as
@inproceedings{fischer1983impossibility,
title = {Impossibility of distributed consensus with one faulty process},
author = {Michael J. Fischer and Nancy A. Lynch and Michael S. Paterson},
year = {1983},
booktitle = {Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems},
publisher = {ACM Press},
pages = {1},
doi = {10.1145/588058.588060},
}
This record lives at https://refs.drheap.org/fischer1983impossibility/ and will keep doing so.