Time is not a healer: Preliminary version
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
Consensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909
Reliable communication in the presence of failures
Birman, K. P., & Joseph, T. A. (1987) · ACM Transactions on Computer Systems · doi:10.1145/7351.7478 · Cited by 997
Authenticated Algorithms for Byzantine Agreement
Dolev, D., & Strong, H. R. (1983) · SIAM Journal on Computing · doi:10.1137/0212045 · Cited by 654
On the minimal synchronism needed for distributed consensus
Dolev, D., Dwork, C., & Stockmeyer, L. (1987) · Journal of the ACM · doi:10.1145/7531.7533 · Cited by 620
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
Synchronizing clocks in the presence of faults
Lamport, L., & Melliar-Smith, P. M. (1985) · Journal of the ACM · doi:10.1145/2455.2457 · Cited by 543
The consensus problem in unreliable distributed systems (a brief survey)
Fischer, M. J. (1983) · Lecture Notes in Computer Science · doi:10.1007/3-540-12689-9_99 · Cited by 367
A new fault-tolerant algorithm for clock synchronization
Welch, J. L., & Lynch, N. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90043-0 · Cited by 282
An upper and lower bound for clock synchronization
Lundelius, J., & Lynch, N. (1984) · Information and Control · doi:10.1016/s0019-9958(84)80033-9 · Cited by 250
The Weak Byzantine Generals Problem
Lamport, L. (1983) · Journal of the ACM · doi:10.1145/2402.322398 · Cited by 221
Simulating authenticated broadcasts to derive simple fault-tolerant algorithms
Srikanth, T. K., & Toueg, S. (1987) · Distributed Computing · doi:10.1007/bf01667080 · Cited by 221
Fault-tolerant clock synchronization
Halpern, J. Y., Simons, B., Strong, R., & Dolev, D. (1984) · Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84 · doi:10.1145/800222.806739 · Cited by 180
Distributed agreement in the presence of processor and communication faults
Perry, K. J., & Toueg, S. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6312888 · Cited by 152
An efficient algorithm for byzantine agreement without authentication
Dolev, D., Fischer, M. J., Fowler, R., Lynch, N., & Strong, H. R. (1982) · Information and Control · doi:10.1016/s0019-9958(82)90776-8 · Cited by 149
Extended impossibility results for asynchronous complete networks
Moran, S., & Wolfstahl, Y. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90052-4 · Cited by 95
On the possibility and impossibility of achieving clock synchronization
Dolev, D., Halpern, J., & Strong, H. R. (1984) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800057.808720 · Cited by 66
Metadata
- Authors
- Santoro, N., & Widmayer, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1989
- Pages
- 304-313
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1683896837
- Cited by
- 179
- References
- 19
- FWCI
- 0.40
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.