{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:41:12Z","timestamp":1774798872810,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1984,8,1]],"date-time":"1984-08-01T00:00:00Z","timestamp":460166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10578,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1984,8]]},"DOI":"10.1016\/s0019-9958(84)80033-9","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T20:43:56Z","timestamp":1115412236000},"page":"190-204","source":"Crossref","is-referenced-by-count":161,"title":["An upper and lower bound for clock synchronization"],"prefix":"10.1016","volume":"62","author":[{"given":"Jennifer","family":"Lundelius","sequence":"first","affiliation":[]},{"given":"Nancy","family":"Lynch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(84)80033-9_bib1","series-title":"Proc. 16th Annu. ACM Symposium on Theory of Computation","first-page":"504","article-title":"On the possibility and impossibility of achieving clock synchronization","author":"Dolev","year":"1984"},{"key":"10.1016\/S0019-9958(84)80033-9_bib2","article-title":"An Efficient Fault-tolerant Algorithm for Clock Synchronization","author":"Halpern","year":"1983","journal-title":"IBM Computer Science Research Report RJ 4094 (45492)"},{"key":"10.1016\/S0019-9958(84)80033-9_bib3","series-title":"Proc. 3rd Annu. ACM Symposium on Principles of Distributed Computing","first-page":"89","article-title":"Fault-tolerant clock synchronization","author":"Halpern","year":"1984"},{"issue":"No. 7","key":"10.1016\/S0019-9958(84)80033-9_bib4","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/S0019-9958(84)80033-9_bib5","series-title":"Proc. 3rd Annu. ACM Symposium on Principles of Distributed Computing","first-page":"68","article-title":"Byzantine clock synchronization","author":"Lamport","year":"1984"},{"key":"10.1016\/S0019-9958(84)80033-9_bib6","article-title":"Synchronizing Clocks in a Distributed System","author":"Lundelius","year":"1984"},{"key":"10.1016\/S0019-9958(84)80033-9_bib7","series-title":"Proc. 3rd Annu. ACM Symposium 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\/S0019-9958(84)80033-9_bib8","article-title":"Loosely-coupled Distributed Services: A Distributed Time Service","author":"Marzullo","year":"1983"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995884800339?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995884800339?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:54:44Z","timestamp":1548525284000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995884800339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,8]]},"references-count":8,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1984,8]]}},"alternative-id":["S0019995884800339"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(84)80033-9","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1984,8]]}}}