{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:39:25Z","timestamp":1725496765489},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653851"},{"type":"electronic","value":"9783540493815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49381-6_49","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:47:50Z","timestamp":1196646470000},"page":"468-475","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Approximate Agreement with Omission Faults"],"prefix":"10.1007","author":[{"given":"Richard","family":"Plunkett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"issue":"4","key":"49_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/12.494101","volume":"45","author":"M. Azadmanesh","year":"1996","unstructured":"M. Azadmanesh, R. Kieckhafer, New Hybrid Fault Models for Asynchronous Approximate AgreementIEEE Trans on Computers, 45(4):439\u20134491996","journal-title":"IEEE Trans on Computers"},{"issue":"3","key":"49_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"D. Dolev, N. Lynch, S. Pinter, E. Stark, W. Weihl, Reaching Approximate Agreement in the Presence of Faults, Journal of the ACM, 33(3)499\u2013516, 1986.","journal-title":"Journal of the ACM"},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01783662","volume":"4","author":"A. Fekete","year":"1990","unstructured":"A. Fekete, Asymptotically Optimal Algorithms for Approximate AgreementDistributedComputing\n                           49\u2013291990","journal-title":"DistributedComputing"},{"issue":"1","key":"49_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1006\/inco.1994.1094","volume":"115","author":"A. Fekete","year":"1994","unstructured":"A. Fekete, Asynchronous Approximate AgreementInformation and Computation\n                           115(1):95\u20131241994","journal-title":"Information and Computation"},{"issue":"4","key":"49_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. Fischer","year":"1982","unstructured":"M. Fischer, N. Lynch, A Lower Bound for the Time to Assure Interactive ConsistencyInformation Processing Letters\n                           14(4):183\u20131861982.","journal-title":"Information Processing Letters"},{"issue":"2","key":"49_CR6","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"M. Fischer, N. Lynch, M. Patterson, Impossibility of Distributed Consensus withOne Faulty ProcessJournal of the ACM, 32(2):374\u20133821985.","journal-title":"Journal of the ACM"},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/71.262588","volume":"5","author":"R. Kieckhafer","year":"1994","unstructured":"R. Kieckhafer, M. Azadmanesh, Reaching Approximate Agreement with Mixed-Mode FaultsIEEE Trans on Parallel and Distributed Systems, 5(1)53\u2013631994.","journal-title":"IEEE Trans on Parallel and Distributed Systems"},{"issue":"2","key":"49_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak, L. Lamport, Reaching Agreement in the Presence of FaultsJournal of the ACM\n                           27(2):228\u20132341980.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49381-6_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:13:01Z","timestamp":1551139981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49381-6_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653851","9783540493815"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-49381-6_49","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}