{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:30:14Z","timestamp":1648989014644},"reference-count":7,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0167-8191(93)90063-q","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"765-775","source":"Crossref","is-referenced-by-count":0,"title":["Reaching approximate agreement on hypercube"],"prefix":"10.1016","volume":"19","author":[{"given":"Ren-Lianq","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Chung-Ping","family":"Chung","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90063-Q_BIB1","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1109\/12.57055","article-title":"Algorithm-based fault-tolerance on a hypercube multiprocessor","volume":"39","author":"Banerjee","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90063-Q_BIB2","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/5925.5931","article-title":"Reaching approximate agreement in the presence of faults","volume":"33","author":"Dolev","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(93)90063-Q_BIB3","series-title":"Proc. 1986 Internat. Conf. Parallel Processing","first-page":"640","article-title":"Distributed routing algorithms for broadcasting and personalized communication in hypercubes","author":"Ho","year":"1986"},{"key":"10.1016\/0167-8191(93)90063-Q_BIB4","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90063-Q_BIB5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/2455.2457","article-title":"Synchronizing clocks in the presence of faults","volume":"32","author":"Lamport","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0167-8191(93)90063-Q_BIB6","series-title":"IEEE 19th Internat. Symp. on Fault-Tolerant Computing","first-page":"142","article-title":"Clock synchronization in MAFT","author":"Thambidurai","year":"1989"},{"key":"10.1016\/0167-8191(93)90063-Q_BIB7","first-page":"1240","article-title":"SIFT: Design and analysis of a fault-tolerant computer for aircraft control","volume":"10","author":"Wensley","year":"1978"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390063Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390063Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:27:57Z","timestamp":1551086877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390063Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":7,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["016781919390063Q"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90063-q","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}