{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T21:09:58Z","timestamp":1672348198583},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0890-5401(91)90067-c","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"205-231","source":"Crossref","is-referenced-by-count":4,"title":["Simultaneity is harder than agreement"],"prefix":"10.1016","volume":"91","author":[{"given":"Brian A.","family":"Coan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia","family":"Dwork","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90067-C_BIB1","series-title":"Proceedings, 4th ACM Symposium on Principles of Distributed Computing","first-page":"149","article-title":"Fast asynchronous Byzantine agreement","author":"Ben-Or","year":"1985"},{"key":"10.1016\/0890-5401(91)90067-C_BIB2","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1145\/31846.42229","article-title":"An O(log n) expected rounds randomized Byzantine generals protocol","volume":"34","author":"Bracha","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90067-C_BIB3","article-title":"The Byzantine firing squad problem","volume":"Vol. 4","author":"Burns","year":"1987"},{"key":"10.1016\/0890-5401(91)90067-C_BIB4","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/TSE.1985.232245","article-title":"A simple and efficient randomized Byzantine agreement algorithm","volume":"SE-11","author":"Chor","year":"1985","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0890-5401(91)90067-C_BIB5","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/65950.65956","article-title":"Simple constant-time consensus protocols in realistic failure models","volume":"36","author":"Chor","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90067-C_BIB6","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1137\/0218068","article-title":"The distributed firing squad problem","volume":"18","author":"Coan","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90067-C_BIB7","series-title":"Proceedings, 5th IEEE Symposium on Reliability in Distributed Software and Database Systems","first-page":"141","article-title":"Simultaneity is harder than agreement","author":"Coan","year":"1986"},{"key":"10.1016\/0890-5401(91)90067-C_BIB8","series-title":"Proceedings, 14th ACM Symposium on Theory of Computing","first-page":"383","article-title":"Cryptographic protocols","author":"DeMillo","year":"1982"},{"key":"10.1016\/0890-5401(91)90067-C_BIB9","first-page":"720","article-title":"Early stopping in Byzantine agreement","volume":"37","author":"Dolev","year":"1990"},{"key":"10.1016\/0890-5401(91)90067-C_BIB10","series-title":"Proceedings, 14th ACM Symposium on Theory of Computing","first-page":"401","article-title":"Polynomial algorithms for multiple processor agreement","author":"Dolev","year":"1982"},{"key":"10.1016\/0890-5401(91)90067-C_BIB11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0890-5401(90)90014-9","article-title":"Knowledge and common knowledge in a Byzantine environment: Crash failures","volume":"88","author":"Dwork","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(91)90067-C_BIB12","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0219032","article-title":"Flipping persuasively in constant time","volume":"19","author":"Dwork","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90067-C_BIB13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","article-title":"A lower bound for the time assure interactive consistency","volume":"14","author":"Fischer","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90067-C_BIB14","article-title":"Issues of Fault Tolerance in Concurrent Computations","author":"Hadzilacos","year":"1984"},{"key":"10.1016\/0890-5401(91)90067-C_BIB15","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/79147.79161","article-title":"Knowledge and common knowledge in a distributed environment","volume":"37","author":"Halpern","year":"1990","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90067-C_BIB16","series-title":"Byzantine generals and transaction commitment protocols","author":"Lamport","year":"1982"},{"key":"10.1016\/0890-5401(91)90067-C_BIB17","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. Programming Languages Syst."},{"key":"10.1016\/0890-5401(91)90067-C_BIB18","article-title":"Cryptographic Protocols","author":"Merritt","year":"1983"},{"key":"10.1016\/0890-5401(91)90067-C_BIB22","unstructured":"Merritt, M. (1984), private communication."},{"key":"10.1016\/0890-5401(91)90067-C_BIB19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01762112","article-title":"Programming simultaneous actions using common knowledge","volume":"3","author":"Moses","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0890-5401(91)90067-C_BIB20","series-title":"Proceedings, 29th IEEE Symposium on Foundations of Computer Science","first-page":"246","article-title":"Coordinated traversal: (t + 1)-Round Byzantine agreement in polynomial time","author":"Moses","year":"1988"},{"key":"10.1016\/0890-5401(91)90067-C_BIB21","series-title":"Proceedings, 24th IEEE Symposium on Foundations of Computer Science","first-page":"403","article-title":"Randomized Byzantine generals","author":"Rabin","year":"1983"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190067C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190067C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:42Z","timestamp":1548879942000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190067C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["089054019190067C"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90067-c","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}