乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:52Z","timestamp":1725851992655},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"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"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_14","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T04:09:41Z","timestamp":1458533381000},"page":"179-191","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Read\/Write Protocol Complex Is Collapsible"],"prefix":"10.1007","author":[{"given":"Fernando","family":"Benavides","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","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"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1137\/S0097539797330689","volume":"31","author":"H Attiya","year":"2002","unstructured":"Attiya, H., Rajsbaum, S.: The combinatorial structure of wait-free solvable tasks. SIAM J. Comput. 31(4), 1286\u20131313 (2002)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","volume":"11","author":"O Biran","year":"1990","unstructured":"Biran, O., Moran, S., Zaks, S.: A combinatorial characterization of the distributed 1-solvable tasks. J. Algorithms 11(3), 420\u2013440 (1990)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC, pp. 91\u2013100. ACM, New York (1993)","key":"14_CR4","DOI":"10.1145\/167088.167119"},{"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, PODC, pp. 41\u201351. ACM, New York (1993)","key":"14_CR5","DOI":"10.1145\/164051.164056"},{"doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A simple algorithmically reasoned characterization of wait-free computation (extended abstract). In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1997, pp. 189\u2013198. ACM, New York (1997)","key":"14_CR6","DOI":"10.1145\/259380.259439"},{"issue":"3","key":"14_CR7","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., Rajsbaum, S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M Fischer","year":"1985","unstructured":"Fischer, M., Lynch, N.A., Paterson, M.S.: Impossibility of distributed commit with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"14_CR9","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)"},{"issue":"6","key":"14_CR10","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s10485-014-9383-6","volume":"23","author":"E Goubault","year":"2015","unstructured":"Goubault, E., Mimram, S., Tasson, C.: Iterated chromatic subdivisions are coll apsible. Appl. Categorical Struct. 23(6), 777\u2013818 (2015)","journal-title":"Appl. Categorical Struct."},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s004460050068","volume":"13","author":"J Havlicek","year":"2000","unstructured":"Havlicek, J.: Computable obstructions to wait-free computability. Distrib. Comput. 13(2), 59\u201383 (2000)","journal-title":"Distrib. Comput."},{"issue":"5","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1137\/S0097539798337224","volume":"33","author":"J Havlicek","year":"2004","unstructured":"Havlicek, J.: A note on the homotopy type of wait-free atomic snapshot protocol complexes. SIAM J. Comput. 33(5), 1215\u20131222 (2004)","journal-title":"SIAM J. Comput."},{"key":"14_CR13","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Elsevier, Imprint Morgan Kaufmann, Boston (2013)"},{"doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: Simulations and reductions for colorless tasks. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2012, pp. 253\u2013260. ACM, New York (2012)","key":"14_CR14","DOI":"10.1145\/2332432.2332483"},{"issue":"6","key":"14_CR15","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. J. ACM 46(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"14_CR16","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco (2008)"},{"doi-asserted-by":"crossref","unstructured":"Hoest, G., Shavit, N.: Towards a topological characterization of asynchronous complexity. In: Proceedings of the 16th ACM Symposium Principles of Distributed Computing, PODC, pp. 199\u2013208. ACM, New York (1997)","key":"14_CR17","DOI":"10.1145\/259380.259440"},{"key":"14_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75859-4","volume-title":"Simplicial Complexes of Graphs","author":"J Jonsson","year":"2008","unstructured":"Jonsson, J.: Simplicial Complexes of Graphs. Lecture Notes in Mathematics. Springer, Heidelberg (2008). doi:\n 10.1007\/978-3-540-75859-4"},{"issue":"2","key":"14_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.4310\/HHA.2012.v14.n2.a12","volume":"14","author":"DN Kozlov","year":"2012","unstructured":"Kozlov, D.N.: Chromatic subdivision of a simplicial complex. Homology Homotopy Appl. 14(2), 197\u2013209 (2012)","journal-title":"Homology Homotopy Appl."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.topol.2014.08.032","volume":"178","author":"DN Kozlov","year":"2014","unstructured":"Kozlov, D.N.: Topology of the immediate snapshot complexes. Topology Appl. 178, 160\u2013184 (2014)","journal-title":"Topology Appl."},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"307","DOI":"10.4310\/HHA.2015.v17.n1.a15","volume":"17","author":"DN Kozlov","year":"2015","unstructured":"Kozlov, D.N.: Topology of the view complex. Homology Homotopy Appl. 17(1), 307\u2013319 (2015)","journal-title":"Homology Homotopy Appl."},{"key":"14_CR22","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 4, 163\u2013183 (1987). JAI Press","journal-title":"Memory requirements for agreement among unreliable asynchronous processes"},{"key":"14_CR23","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-540-69733-6_48","volume-title":"Computing and Combinatorics","author":"S Rajsbaum","year":"2008","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: The iterated restricted immediate snapshot model. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol. 5092, pp. 487\u2013497. Springer, Heidelberg (2008)"},{"issue":"5","key":"14_CR24","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. 29(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:21:19Z","timestamp":1559409679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 March 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}