{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:15:54Z","timestamp":1725574554136},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201847"},{"type":"electronic","value":"9783540399896"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39989-6_19","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T21:01:57Z","timestamp":1294434117000},"page":"264-278","source":"Crossref","is-referenced-by-count":3,"title":["Tight Bounds on Early Local Decisions in Uniform Consensus"],"prefix":"10.1007","author":[{"given":"Partha","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bastian","family":"Pochon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3-4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00100-3","volume":"71","author":"M.K. Aguilera","year":"1999","unstructured":"Aguilera, M.K., Toueg, S.: A Simple Bivalency Proof that i-Resilient Consensus Requires i +1 Rounds. Information Processing Letters (IPL)\u00a071(3-4), 155\u2013158 (1999)","journal-title":"Information Processing Letters (IPL)"},{"issue":"2","key":"19_CR2","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. Journal of the ACM (JACM)\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM (JACM)"},{"key":"19_CR3","unstructured":"Charron-Bost, B., Schiper, A.: Uniform Consensus Harder than Consensus. Technical Report ID: DSC\/2000\/028, Swiss Federal Institute of Technology in Lausanne, EPFL (2000)"},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, R.: Early stopping in byzantine agreement. Journal of the ACM (JACM)\u00a037(4), 720\u2013741 (1990)","journal-title":"Journal of the ACM (JACM)"},{"key":"19_CR5","first-page":"88","volume-title":"Proc. 21st ACM Symposium on Principles of Distributed Computing, (PODC 2002)","author":"P. Dutta","year":"2002","unstructured":"Dutta, P., Guerraoui, R.: The Inherent Price of Indulgence. In: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey (CA), pp. 88\u201397. ACM Press, New York (2002)"},{"key":"19_CR6","unstructured":"Dutta, P., Guerraoui, R., Pochon, B.: Early Local Decisions in Distributed Agreement. Technical Report ID: 200324, School of Computer and Communication Sciences, Swiss Federal Institute of Technology in Lausanne (EPFL). Available at: \n                  \n                    http:\/\/ic2.epfl.ch\/publications\/documents\/IC_TECH_REPORT_200324.pdf"},{"issue":"2","key":"19_CR7","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. Journal of the ACM (JACM)\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM (JACM)"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. Fischer","year":"1982","unstructured":"Fischer, M., Lynch, N.: A Lower Bound for the Time to Assure Interactive Consistency. Information Processing Letters (IPL)\u00a014(4), 183\u2013186 (1982)","journal-title":"Information Processing Letters (IPL)"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM (JACM)\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM (JACM)"},{"key":"19_CR10","unstructured":"Hadzilacos, V.: Byzantine Agreement Under Restricted Types of Failures (Not Telling the Truth is Different from Telling Lies.) Technical Report ID: TR-19-83, Aiken Computation Laboratory, Harvard University"},{"key":"19_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0042336","volume-title":"Proc. 9th International Workshop on Fault-Tolerant Computing","author":"V. Hadzilacos","year":"1987","unstructured":"Hadzilacos, V.: On the relationship between the Atomic Commitment and Consensus problems. In: Proc. 9th International Workshop on Fault-Tolerant Computing. LNCS, vol.\u00a0448, pp. 201\u2013208. Springer, Heidelberg (1987)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-37795-6_8","volume-title":"Future Directions in Distributed Computing","author":"I. Keidar","year":"2003","unstructured":"Keidar, I., Rajsbaum, S.: Open Questions on Consensus Performance in Well-Behaved Runs. In: Schiper, A., Shvartsman, M.M.A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol.\u00a02584, pp. 35\u201339. Springer, Heidelberg (2003)"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0190(02)00333-2","volume":"85","author":"I. Keidar","year":"2003","unstructured":"Keidar, I., Rajsbaum, S.: A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters (IPL)\u00a085(1), 47\u201352 (2003)","journal-title":"Information Processing Letters (IPL)"},{"key":"19_CR14","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann Pub., San Francisco (CA), 872 pages (1996)"},{"issue":"2","key":"19_CR15","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 Transactions on Computer Systems (TOCS)\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1137\/S0097539799364006","volume":"31","author":"Y. Moses","year":"2002","unstructured":"Moses, Y., Rajsbaum, S.: A Layered Analysis of Consensus. SIAM Journal on Computing\u00a031(4), 989\u20131021 (2002)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39989-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:52:02Z","timestamp":1578520322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39989-6_19"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201847","9783540399896"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39989-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}