{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:01:50Z","timestamp":1725566510167},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233060"},{"type":"electronic","value":"9783540301868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30186-8_3","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T19:48:23Z","timestamp":1285184903000},"page":"30-40","source":"Crossref","is-referenced-by-count":8,"title":["Group-Solvability"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Roller, D., Peleg, D., Reischuk, R.: Achievable Cases in an Asynchronous Environment. In: Proceedings of the 28th Symposium on Foundations of Computer Science, pp. 337\u2013346 (1987)","DOI":"10.1109\/SFCS.1987.5"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/PL00008918","volume":"13","author":"Y. Joung","year":"2000","unstructured":"Joung, Y.: Asynchronous group mutual-exclusion. Distributed Computing\u00a013, 189\u2013206 (2000)","journal-title":"Distributed Computing"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Hadzilacos, V.: A note on group mutual-exclusion. In: Proceedings of the 20th ACM Symposium on Principles of Distributed Computing, pp. 100\u2013106 (2001)","DOI":"10.1145\/383962.383997"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-40026-5_11","volume-title":"Distributed Computing","author":"M. Merritt","year":"2000","unstructured":"Merritt, M., Taubenfeld, G.: Computing with infinitly many processes. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 164\u2013178. Springer, Heidelberg (2000)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Gafni, E.: A simple algorithmic characterization of uniform solvability. In: Proceedings of the 4rd Annual IEEE Symposium On Foundation of Computer Science (FOCS 2002), pp. 228\u2013237 (2002)","DOI":"10.1109\/SFCS.2002.1181946"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. In: Proceedings of the 21th ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 78\u201387 (2002)","DOI":"10.1145\/571825.571837"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming. In: Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pp. 41\u201351 (1993)","DOI":"10.1145\/164051.164056"},{"issue":"6","key":"3_CR8","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 computabil-ity. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computations. In: PODC 1997, pp. 189\u2013198 (1997)","DOI":"10.1145\/259380.259439"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Dolev, D.: Shared-memory vs. message-passing in an asynchronous distributed environment. In: PODC 1989, pp. 307\u2013318 (1989)","DOI":"10.1145\/72981.73003"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merrit, M., Shavit, N.: Atomic Snapshots of Shared Memory. In: Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, pp. 1\u201313 (1990)","DOI":"10.21236\/ADA222765"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"G. Frederickson","year":"1987","unstructured":"Frederickson, G., Lynch, N.: Electing a Leader in a Synchronous Ring. Journal of the ACM\u00a034(1), 98\u2013115 (1987)","journal-title":"Journal of the ACM"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations. In: Proceedings of the 25th ACM Symposium on the Theory of Computing, pp. 91\u2013100 (1993)","DOI":"10.1145\/167088.167119"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Saks, M., Zaharoglou, F.: Wait-Free A;-Set Agreement is Impossible: The Topology of Public Knowledge. In: Proceedings of the 26th ACM Symposium on the Theory of Computing, pp. 101\u2013110 (1993)","DOI":"10.1145\/167088.167122"},{"key":"3_CR15","volume-title":"Algebraic Topology","author":"E.H. Spanier","year":"1966","unstructured":"Spanier, E.H.: Algebraic Topology. Springer, New York (1966)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30186-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:46:18Z","timestamp":1605761178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30186-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233060","9783540301868"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30186-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}