{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:30Z","timestamp":1742914110654,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_91","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:36:50Z","timestamp":1214505410000},"page":"198-202","source":"Crossref","is-referenced-by-count":1,"title":["Consensus with Partial Synchrony"],"prefix":"10.1007","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schiper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Dolev, D., Dwork, C., Strong, H.R.: Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement. In: PODC, 1987, pp.\u00a042\u201351","key":"91_CR1_91","DOI":"10.1145\/41840.41844"},{"issue":"4","key":"91_CR2_91","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Hadzilacos, V., Toueg, S.: The Weakest Failure Detector for Solving Consensus. J.\u00a0ACM 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"91_CR3_91","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J.\u00a0ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"unstructured":"Charron-Bost, B., Schiper A.: The \u201cHeard-Of\u201d model: Computing in distributed systems with benign failures. Technical Report, EPFL (2007)","key":"91_CR4_91"},{"issue":"1","key":"91_CR5_91","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchrony needed for distributed consensus. J.\u00a0ACM 34(1), 77\u201397 (1987)","journal-title":"J. ACM"},{"issue":"4","key":"91_CR6_91","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Strong, H.R.: Authenticated Algorithms for Byzantine Agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"91_CR7_91","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J.\u00a0ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"91_CR8_91","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fischer","year":"1985","unstructured":"Fischer, M., Lynch, N., Paterson, M.: Impossibility of Distributed Consensus with One Faulty Process. J.\u00a0ACM 32, 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"91_CR9_91","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/BFb0042322","volume-title":"Fault-Tolerant Distributed Computing [Asilomar Workshop 1986]. LNCS, vol. 448","author":"J. Gray","year":"1990","unstructured":"Gray, J.: A\u00a0Comparison of the Byzantine Agreement Problem and the Transaction Commit Problem. In: Fault-Tolerant Distributed Computing [Asilomar Workshop 1986]. LNCS, vol.\u00a0448, pp.\u00a010\u201317. Springer, Berlin (1990)"},{"issue":"7","key":"91_CR10_91","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, Clocks, and the Ordering of Events in a\u00a0Distributed System. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"91_CR11_91","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The Part-Time Parliament. ACM Trans. on Computer Systems 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. on Computer Systems"},{"issue":"2","key":"91_CR12_91","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching Agreement in the Presence of Faults. J.\u00a0ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Rabin, M.: Randomized Byzantine Generals. In: Proc. 24th Annual ACM Symposium on Foundations of Computer Science, 1983, pp.\u00a0403\u2013409","key":"91_CR13_91","DOI":"10.1109\/SFCS.1983.48"},{"unstructured":"Schneider, F.B.: Replication Management using the State-Machine Approach. In Sape Mullender, editor, Distributed Systems, pp.\u00a0169\u2013197. ACM Press (1993)","key":"91_CR14_91"},{"issue":"2","key":"91_CR15_91","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating Authenticated Broadcasts to Derive Simple Fault-Tolerant Algorithms. Distrib. Comp. 2(2), 80\u201394 (1987)","journal-title":"Distrib. Comp."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T02:06:30Z","timestamp":1662170790000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_91"}},"subtitle":["1988; Dwork, Lynch, Stockmeyer"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_91","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}