乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:47Z","timestamp":1725518447897},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877783"},{"type":"electronic","value":"9783540877790"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87779-0_8","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T05:17:14Z","timestamp":1222060634000},"page":"109-120","source":"Crossref","is-referenced-by-count":18,"title":["The Weakest Failure Detector for Message Passing Set-Agreement"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Tielmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S. Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems. Inf. Comput.\u00a0105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M. Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput.\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/167088.167119","volume-title":"STOC 1993: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC 1993: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pp. 91\u2013100. ACM, New York (1993)"},{"issue":"6","key":"8_CR4","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"issue":"2","key":"8_CR5","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\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"issue":"4","key":"8_CR6","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. ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11945529_2","volume-title":"Principles of Distributed Systems","author":"M. Raynal","year":"2006","unstructured":"Raynal, M., Travers, C.: In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 3\u201319. Springer, Heidelberg (2006)"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/1281100.1281135","volume-title":"PODC 2007: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N., Newport, C.: On the weakest failure detector ever. In: PODC 2007: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pp. 235\u2013243. ACM, New York (2007)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-75142-7_12","volume-title":"Distributed Computing","author":"W. Chen","year":"2007","unstructured":"Chen, W., Zhang, J., Chen, Y., Liu, X.: Weakening failure detectors for k -set agreement via the partition approach. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 123\u2013138. Springer, Heidelberg (2007)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Zieli\u0144ski, P.: Anti-Omega: the weakest failure detector for set agreement. In: PODC 2008: Proceedings of the twenty-seventh annual ACM symposium on Principles of distributed computing (2008)","DOI":"10.1145\/1400751.1400761"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Zieli\u0144ski, P.: Anti-Omega: the weakest failure detector for set-agreement. Technical report, UCAM-CL-TR-694 (2007)","DOI":"10.1145\/1400751.1400761"},{"key":"8_CR12","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Shared memory vs message passing. Technical report, LPD-REPORT-2003-001 (2003)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Sharing is harder than agreeing. In: PODC 2008: Proceedings of the twenty-seventh annual ACM symposium on Principles of distributed computing (2008)","DOI":"10.1145\/1400751.1400764"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"J. ACM"},{"key":"8_CR15","unstructured":"Guerraoui, R.: Indulgent algorithms. In: PODC 2000: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-75142-7_35","volume-title":"Distributed Computing","author":"P. Zieli\u0144ski","year":"2007","unstructured":"Zieli\u0144ski, P.: Automatic classification of eventual failure detectors. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 465\u2013479. Springer, Heidelberg (2007)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_15","volume-title":"Distributed Computing","author":"C. Delporte-Gallet","year":"2005","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R. (Almost) all objects are universal in message passing systems. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87779-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T04:08:41Z","timestamp":1714795721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87779-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877783","9783540877790"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87779-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}