{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:47:02Z","timestamp":1725623222597},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642240997"},{"type":"electronic","value":"9783642241000"}],"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-24100-0_45","type":"book-chapter","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T02:20:40Z","timestamp":1318990840000},"page":"489-504","source":"Crossref","is-referenced-by-count":3,"title":["Oblivious Collaboration"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[]},{"given":"Yakov","family":"Babichenko","sequence":"additional","affiliation":[]},{"given":"Uriel","family":"Feige","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]},{"given":"Nati","family":"Linial","sequence":"additional","affiliation":[]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. In: FOCS, pp. 218\u2013223 (1979)","key":"45_CR1","DOI":"10.1109\/SFCS.1979.34"},{"issue":"3","key":"45_CR2","doi-asserted-by":"publisher","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\u00a037(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"issue":"5","key":"45_CR3","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/S0097539794319126","volume":"26","author":"R.J. Anderson","year":"1997","unstructured":"Anderson, R.J., Woll, H.: Algorithms for the Certified Write-All Problem. SIAM J. Comput.\u00a026(5), 1277\u20131283 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"45_CR4","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. Journal of the ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"Journal of the ACM"},{"unstructured":"Afek, Y., Babichenko, Y., Feige, U., Gafni, E., Linial, N., Sudakov, B.: Oblivious Collaboration (ArXiv version of current paper.), http:\/\/arxiv.org\/abs\/1106.2065","key":"45_CR5"},{"doi-asserted-by":"crossref","unstructured":"Afek, Y., Alon, N., Bar-Joseph, Z., Cornejo, A., Haeupler, B., Kuhn, F.: Beeping a Maximal Independent Set. In: Proc. 25th Int\u2019l Symposium on Distributed Computing (DISC 2011), Rome Italy (September 20-22, 2011)","key":"45_CR6","DOI":"10.1007\/978-3-642-24100-0_3"},{"key":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/11947950_36","volume-title":"Distributed Computing and Networking","author":"Y. Afek","year":"2006","unstructured":"Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M., Travers, C.: Simultaneous consensus tasks: A tighter characterization of set-consensus. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol.\u00a04308, pp. 331\u2013341. Springer, Heidelberg (2006)"},{"unstructured":"Beame, P., Blais, E., Ngoc, D.: Longest common subsequences in sets of permutations, http:\/\/arxiv4.library.cornell.edu\/abs\/0904.1615?context=math","key":"45_CR8"},{"doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computing (STOC 1993), pp. 91\u2013100 (1993)","key":"45_CR9","DOI":"10.1145\/167088.167119"},{"doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology upper and lower bounds for renaming. In: PODC, pp. 295\u2013304 (2008)","key":"45_CR10","DOI":"10.1145\/1400751.1400791"},{"issue":"11","key":"45_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge, ISBN 0-262-04178-2","key":"45_CR12"},{"unstructured":"Dolev, D., Lynch, N.A., Pinter, S., Stark, E.W., Weihl, W.E.: Reaching Approximate Agreement in the Presence of Faults. In: Symposium on Reliability in Distributed Software and Database Systems, pp. 145\u2013154 (1983)","key":"45_CR13"},{"key":"45_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11947950_38","volume-title":"Distributed Computing and Networking","author":"E. Gafni","year":"2006","unstructured":"Gafni, E.: Read-write reductions. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds.) ICDCN 2006. LNCS, vol.\u00a04308, pp. 349\u2013354. Springer, Heidelberg (2006)"},{"issue":"14","key":"45_CR15","doi-asserted-by":"publisher","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.\u00a0410(14), 1328\u20131335 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"45_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11561927_7","volume-title":"Distributed Computing","author":"E. Gafni","year":"2005","unstructured":"Gafni, E., Rajsbaum, S.: Musical benches. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 63\u201377. Springer, Heidelberg (2005)"},{"key":"45_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/11682462_47","volume-title":"LATIN 2006: Theoretical Informatics","author":"E. Gafni","year":"2006","unstructured":"Gafni, E., Rajsbaum, R., Raynal, M., Travers, C.: The committee decision problem. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 502\u2013514. Springer, Heidelberg (2006)"},{"issue":"6","key":"45_CR18","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M.P. Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"issue":"7","key":"45_CR19","first-page":"395","volume":"19","author":"R.M. Metcalfe","year":"1976","unstructured":"Metcalfe, R.M., Boggs, D.R.: Ethernet: Distributed packet switching for local computer networks. Commun. Ass. Comput. Mach.\u00a019(7), 395\u2013404 (1976)","journal-title":"Commun. Ass. Comput. Mach."},{"issue":"5","key":"45_CR20","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 Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24100-0_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T22:47:30Z","timestamp":1560811650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24100-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642240997","9783642241000"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24100-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}