{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:46Z","timestamp":1766281006548},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9969,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1986,4]]},"DOI":"10.1016\/0022-0000(86)90028-0","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"230-250","source":"Crossref","is-referenced-by-count":76,"title":["On the possibility and impossibility of achieving clock synchronization"],"prefix":"10.1016","volume":"32","author":[{"given":"Danny","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph Y.","family":"Halpern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.Raymond","family":"Strong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(86)90028-0_BIB1","series-title":"Proceedings of the 2nd ACM Conference on Distributed Computing","first-page":"27","article-title":"Another advantage of the free choice: Completely asynchronous agreement protocols","author":"Ben-Or","year":"1983"},{"key":"10.1016\/0022-0000(86)90028-0_BIB2","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","article-title":"The Byzantine generals strike again","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(86)90028-0_BIB3","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/0212045","article-title":"Authenticated algorithm for Byzantine agreement","volume":"12","author":"Dolev","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(86)90028-0_BIB4","series-title":"Proceedings of the 4th ACM Conference on Distributed Computing","first-page":"59","article-title":"Easy impossibility proofs for distributed consensus problems","author":"Fischer","year":"1985"},{"key":"10.1016\/0022-0000(86)90028-0_BIB5","series-title":"Proceedings of the 17th Annual ACM Symposium on Theory of Computing","first-page":"346","article-title":"Optimal precision in the presence of uncertainty","author":"Halpern","year":"1985"},{"key":"10.1016\/0022-0000(86)90028-0_BIB6","series-title":"Proceedings of the 3rd ACM Conference on Principles of Distributed Computing","first-page":"89","article-title":"Fault-tolerant clock synchronization","author":"Halpern","year":"1984"},{"key":"10.1016\/0022-0000(86)90028-0_BIB7_1","series-title":"2nd ACM Conference on Principles of Distributed Computing","article-title":"Unsolved problems, solved problems, and non-problems in concurrency, invited address","author":"Lamport","year":"1983"},{"key":"10.1016\/0022-0000(86)90028-0_BIB7_2","series-title":"Proceedings of the 3rd ACM Conference on Principles of Distributed Computing","first-page":"1","article-title":"Unsolved problems, solved problems, and non-problems in concurrency, invited address","author":"Lamport","year":"1984"},{"key":"10.1016\/0022-0000(86)90028-0_BIB8_1","series-title":"Proceedings of the 3rd ACM Conference on Principles of Distributed Computing","first-page":"68","article-title":"Byzantine clock synchronization","author":"Lamport","year":"1984"},{"key":"10.1016\/0022-0000(86)90028-0_BIB8_2","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/2455.2457","article-title":"Synchronization clocks in the presence of faults","volume":"32","author":"Lamport","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(86)90028-0_BIB9","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The Byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans. Prog. Lang. and Systems"},{"key":"10.1016\/0022-0000(86)90028-0_BIB10","series-title":"Proceedings of the 3rd ACM Conference on Principles of Distributed Computing","first-page":"75","article-title":"A new fault-tolerant algorithm for clock synchronization","author":"Lundelius","year":"1984"},{"key":"10.1016\/0022-0000(86)90028-0_BIB11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(84)80033-9","article-title":"An upper and lower bound for clock synchronization","volume":"62","author":"Lundelius","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(86)90028-0_BIB12","article-title":"Loosely-Coupled Distributed Services: A Distributed Time System","author":"Marzullo","year":"1983"},{"key":"10.1016\/0022-0000(86)90028-0_BIB14","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","article-title":"Reaching agreement in the presence of faults","volume":"27","author":"Pease","year":"1980","journal-title":"J. Assoc. Comput Mach."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900280?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900280?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:52:25Z","timestamp":1550325145000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000086900280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0022000086900280"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(86)90028-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}