{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T22:10:29Z","timestamp":1736028629722,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_28","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T14:14:47Z","timestamp":1128953687000},"page":"384-398","source":"Crossref","is-referenced-by-count":0,"title":["Space and Step Complexity Efficient Adaptive Collect"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[]},{"given":"Yaron","family":"De Levie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"28_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\u00a040(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/301308.301335","volume-title":"PODC 1999: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing","author":"Y. Afek","year":"1999","unstructured":"Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-lived renaming made adaptive. In: PODC 1999: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pp. 91\u2013103. ACM Press, New York (1999)"},{"key":"28_CR3","unstructured":"Afek, Y., De Levie, Y.: Space and step complexity efficient adaptive collect, http:\/\/www.cs.tau.ac.il\/~afek\/papers\/collect.pdf"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/277697.277749","volume-title":"PODC 1998: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Fouren, A.: Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract). In: PODC 1998: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pp. 277\u2013286. ACM Press, New York (1998)"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/792538.792541","volume":"50","author":"H. Attiya","year":"2003","unstructured":"Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM\u00a050(4), 444\u2013468 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s004460100067","volume":"15","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing\u00a015(2), 87\u201396 (2002)","journal-title":"Distributed Computing"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/1011767.1011777","volume-title":"PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Fich, F.E., Kaplan, Y.: Lower bounds for adaptive collect and related objects. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 60\u201369. ACM Press, New York (2004)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-30186-8_12","volume-title":"Distributed Computing","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Kuhn, F., Wattenhofer, M., Wattenhofer, R.: Efficient adaptive collect using randomization. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 159\u2013173. Springer, Heidelberg (2004)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 262\u2013272 (1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6423(95)00009-H","volume":"25","author":"M. Moir","year":"1995","unstructured":"Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming\u00a025(1), 1\u201339 (1995)","journal-title":"Science of Computer Programming"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T21:44:07Z","timestamp":1736027047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11561927_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}