{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:51Z","timestamp":1725574131761},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176784"},{"type":"electronic","value":"9783642176791"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-17679-1_17","type":"book-chapter","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T18:44:30Z","timestamp":1294253070000},"page":"191-202","source":"Crossref","is-referenced-by-count":6,"title":["Relating $\\mathcal{L}$ -Resilience and Wait-Freedom via Hitting Sets"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"17_CR1","first-page":"873","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.\u00a0ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"J.\u00a0ACM"},{"key":"17_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, New York (May 1993)","DOI":"10.1145\/167088.167119"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/259380.259439","volume-title":"PODC 1997: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing","author":"E. Borowsky","year":"1997","unstructured":"Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In: PODC 1997: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 189\u2013198. ACM Press, New York (1997)"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","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. Distributed Computing\u00a014(3), 127\u2013146 (2001)","journal-title":"Distributed Computing"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-642-04355-0_6","volume-title":"Distributed Computing","author":"C. Delporte-Gallet","year":"2009","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 8\u201321. Springer, Heidelberg (2009)"},{"issue":"2","key":"17_CR6","first-page":"374","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J.\u00a0ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J.\u00a0ACM"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round fault detectors (extended abstract): Unifying synchrony and asynchrony. In: Proceedings of the 17th Symposium on Principles of Distributed Computing (1998)","DOI":"10.1145\/277697.277724"},{"key":"17_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"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539796305766","volume":"28","author":"E. Gafni","year":"1999","unstructured":"Gafni, E., Koutsoupias, E.: Three-processor tasks are undecidable. SIAM J. Comput.\u00a028(3), 970\u2013983 (1999)","journal-title":"SIAM J. Comput."},{"key":"17_CR10","unstructured":"Gafni, E., Kuznetsov, P.: L-resilient adversaries and hitting sets. CoRR, abs\/1004.4701 (2010), http:\/\/arxiv.org\/abs\/1004.4701"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P.: Turning adversaries into friends: Simplified, made constructive, and extended. In: OPODIS (2011)","DOI":"10.1007\/978-3-642-17653-1_28"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","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.\u00a013(1), 123\u2013149 (1991)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"17_CR13","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: ICDCS, pp. 522\u2013529 (2003)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The decidability of distributed decision tasks (extended abstract). In: STOC, pp. 589\u2013598 (1997)","DOI":"10.1145\/258533.258652"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The topology of shared-memory adversaries. In: PODC (2010)","DOI":"10.1145\/1835698.1835724"},{"issue":"2","key":"17_CR16","first-page":"858","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J.\u00a0ACM\u00a046(2), 858\u2013923 (1999)","journal-title":"J.\u00a0ACM"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Imbs, D., Raynal, M.: Visiting gafni\u2019s reduction land: From the bg simulation to the extended bg simulation. In: SSS, pp. 369\u2013383 (2009)","DOI":"10.1007\/978-3-642-05118-0_26"},{"issue":"17","key":"17_CR18","doi-asserted-by":"publisher","first-page":"2255","DOI":"10.1002\/cpe.1170","volume":"19","author":"F. Junqueira","year":"2007","unstructured":"Junqueira, F., Marzullo, K.: A framework for the design of dependent-failure algorithms. Concurrency and Computation: Practice and Experience\u00a019(17), 2255\u20132269 (2007)","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"17_CR19","first-page":"163","volume":"4","author":"M. Loui","year":"1987","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research\u00a04, 163\u2013183 (1987)","journal-title":"Advances in Computing Research"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17679-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T16:09:25Z","timestamp":1559923765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17679-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642176784","9783642176791"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17679-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}