{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:10:45Z","timestamp":1726409445105},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319483139"},{"type":"electronic","value":"9783319483146"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-48314-6_8","type":"book-chapter","created":{"date-parts":[[2016,11,3]],"date-time":"2016-11-03T15:01:04Z","timestamp":1478185264000},"page":"111-126","source":"Crossref","is-referenced-by-count":0,"title":["Asynchronous Coordination Under Preferences and Constraints"],"prefix":"10.1007","author":[{"given":"Armando","family":"Casta\u00f1eda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthieu","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"issue":"4","key":"8_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":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-642-24100-0_45","volume-title":"Distributed Computing","author":"Y Afek","year":"2011","unstructured":"Afek, Y., Babichenko, Y., Feige, U., Gafni, E., Linial, N., Sudakov, B.: Oblivious collaboration. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 489\u2013504. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-24100-0_45"},{"issue":"3","key":"8_CR3","doi-asserted-by":"crossref","first-page":"1578","DOI":"10.1137\/12088478X","volume":"28","author":"Y Afek","year":"2014","unstructured":"Afek, Y., Babichenko, Y., Feige, U., Gafni, E., Linial, N., Sudakov, B.: Musical chairs. SIAM J. Discrete Math. 28(3), 1578\u20131600 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"8_CR4","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"key":"8_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing Fundamentals, Simulations, and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing Fundamentals, Simulations, and Advanced Topics, 2nd edn. Wiley, New York (2004)","edition":"2"},{"issue":"2","key":"8_CR6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(96)00031-X","volume":"162","author":"BS Baker","year":"1996","unstructured":"Baker, B.S., Coffman Jr., E.G.: Mutual exclusion scheduling. Theor. Comput. Sci. 162(2), 225\u2013243 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(95)00057-4","volume":"148","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. Part I. Theor. Comput. Sci. 148(1), 93\u2013109 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for $$t$$ t -resilient asynchronous computations. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 91\u2013100. ACM, New York (1993)","DOI":"10.1145\/167088.167119"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, PODC 1993, pp. 41\u201351. ACM, New York (1993)","DOI":"10.1145\/164051.164056"},{"issue":"3","key":"8_CR10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.cosrev.2011.04.001","volume":"5","author":"A Casta\u00f1eda","year":"2011","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: The renaming problem in shared memory systems: an introduction. Comput. Sci. Rev. 5(3), 229\u2013251 (2011)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"8_CR11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10951-008-0089-1","volume":"12","author":"G Even","year":"2009","unstructured":"Even, G., Halld\u00f3rsson, M.M., Kaplan, L., Ron, D.: Scheduling with conflicts: online and offline algorithms. J. Sched. 12(2), 199\u2013224 (2009)","journal-title":"J. Sched."},{"key":"8_CR12","series-title":"Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02008-7","volume-title":"Distributed Computing by Oblivious Mobile Robots","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafeal (2012)"},{"issue":"14","key":"8_CR13","doi-asserted-by":"crossref","first-page":"1328","DOI":"10.1016\/j.tcs.2008.05.016","volume":"410","author":"E Gafni","year":"2009","unstructured":"Gafni, E., Most\u00e9faoui, A., Raynal, M., Travers, C.: From adaptive renaming to set agreement. Theor. Comput. Sci. 410(14), 1328\u20131335 (2009). Structural Information and Communication Complexity (SIROCCO 2007)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-16023-3_30","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"E Gafni","year":"2010","unstructured":"Gafni, E., Rajsbaum, S.: Recursion in distributed computing. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 362\u2013376. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16023-3_30"},{"issue":"2","key":"8_CR15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1137\/0204015","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M.R., Graham, R.L.: Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4(2), 187\u2013200 (1975)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"8_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0890-5401(02)00032-9","volume":"180","author":"MM Halld\u00f3rsson","year":"2003","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G., Proskurowski, A., Salman, R., Shachnai, H., Telle, J.A.: Multicoloring trees. Inf. Comput. 180(2), 113\u2013129 (2003)","journal-title":"Inf. Comput."},{"key":"8_CR17","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, San Francisco (2013)"},{"issue":"6","key":"8_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(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"8_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-32027-9","volume-title":"Concurrent Programming: Algorithms, Principles, and Foundations","author":"M Raynal","year":"2013","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles, and Foundations. Springer, Heidelberg (2013)"},{"issue":"5","key":"8_CR20","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(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48314-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T10:08:02Z","timestamp":1718878082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48314-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319483139","9783319483146"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48314-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}