{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:18:43Z","timestamp":1725887923928},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596464"},{"type":"electronic","value":"9783319596471"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59647-1_14","type":"book-chapter","created":{"date-parts":[[2017,5,13]],"date-time":"2017-05-13T02:53:30Z","timestamp":1494644010000},"page":"175-190","source":"Crossref","is-referenced-by-count":3,"title":["Agreement Functions for Distributed Computing Models"],"prefix":"10.1007","author":[{"given":"Petr","family":"Kuznetsov","sequence":"first","affiliation":[]},{"given":"Thibault","family":"Rieutord","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for $$t$$ -resilient asynchronous computations. In: STOC, pp. 91\u2013100. ACM Press, May 1993","DOI":"10.1145\/167088.167119"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC, pp. 41\u201351. ACM Press, New York (1993)","DOI":"10.1145\/164051.164056"},{"issue":"3","key":"14_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N.A., Rajsbaum, S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"issue":"1","key":"14_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00446-014-0231-6","volume":"28","author":"C Delporte-Gallet","year":"2015","unstructured":"Delporte-Gallet, C., Fauconnier, H., Gafni, E., Kuznetsov, P.: Wait-freedom with advice. Distrib. Comput. 28(1), 3\u201319 (2015)","journal-title":"Distrib. Comput."},{"issue":"3\u20134","key":"14_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00446-010-0122-4","volume":"24","author":"C Delporte-Gallet","year":"2011","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. Distrib. Comput. 24(3\u20134), 137\u2013147 (2011)","journal-title":"Distrib. Comput."},{"issue":"2","key":"14_CR7","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Gafni, E.: The extended BG-simulation and the characterization of t-resiliency. In: STOC, pp. 85\u201392 (2009)","DOI":"10.1145\/1536414.1536428"},{"key":"14_CR9","unstructured":"Gafni, E., Guerraoui, R.: Simulating few by many: limited concurrency = set consensus. Technical report (2009). http:\/\/web.cs.ucla.edu\/eli\/eli\/kconc.pdf"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-23217-6_2","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"E Gafni","year":"2011","unstructured":"Gafni, E., Guerraoui, R.: Generalized universality. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 17\u201327. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23217-6_2"},{"key":"14_CR11","unstructured":"Gafni, E., He, Y., Kuznetsov, P., Rieutord, T.: Read-write memory and k-set consensus as an affine task. In: OPODIS (2016). Technical report. https:\/\/arxiv.org\/abs\/1610.01423"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-17653-1_28","volume-title":"Principles of Distributed Systems","author":"E Gafni","year":"2010","unstructured":"Gafni, E., Kuznetsov, P.: Turning adversaries into friends: simplified, made constructive, and extended. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 380\u2013394. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-17653-1_28"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P.: Relating L-resilience and wait-freedom via hitting sets. In: ICDCN, pp. 191\u2013202 (2011)","DOI":"10.1007\/978-3-642-17679-1_17"},{"issue":"1","key":"14_CR14","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Prog. Lang. Syst. 13(1), 123\u2013149 (1991)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"14_CR15","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2014","unstructured":"Herlihy, M., Kozlov, D.N., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, Burlington (2014)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The topology of shared-memory adversaries. In: PODC, pp. 105\u2013113 (2010)","DOI":"10.1145\/1835698.1835724"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: Simulations and reductions for colorless tasks. In: PODC, pp. 253\u2013260 (2012)","DOI":"10.1145\/2332432.2332483"},{"issue":"2","key":"14_CR18","doi-asserted-by":"crossref","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. J. ACM 46(2), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"14_CR19","first-page":"53","volume":"106","author":"P Kuznetsov","year":"2012","unstructured":"Kuznetsov, P.: Understanding non-uniform failure models. Bull. EATCS 106, 53\u201377 (2012)","journal-title":"Bull. EATCS"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Rieutord, T.: Agreement functions for distributed computing models. CoRR, abs\/1004.4701 (2017)","DOI":"10.1007\/978-3-319-59647-1_14"},{"key":"14_CR21","first-page":"163","volume":"4","author":"MC Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163\u2013183 (1987)","journal-title":"Adv. Comput. Res."},{"key":"14_CR22","doi-asserted-by":"crossref","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. 29, 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-15763-9_23","volume-title":"Distributed Computing","author":"G Taubenfeld","year":"2010","unstructured":"Taubenfeld, G.: The computational structure of progress conditions. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 221\u2013235. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15763-9_23"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T15:58:01Z","timestamp":1569340681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}