{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:55:35Z","timestamp":1725472535895},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540680673"},{"type":"electronic","value":"9783540680703"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11946441_39","type":"book-chapter","created":{"date-parts":[[2006,11,18]],"date-time":"2006-11-18T10:52:47Z","timestamp":1163847167000},"page":"394-405","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform"],"prefix":"10.1007","author":[{"given":"Burkhard","family":"Englert","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-Lived Renaming made adaptive. In: Proc. of 18th ACM Symp. on Principles of Distributed Computing (PODC), pp. 91\u2013103 (1999)","DOI":"10.1145\/301308.301335"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Boxer, P., Touitou, D.: Bounds on the shared memory requirements for long-lived and adaptive objects. In: Proc. of the 19th ACM Symp. on Principles of Distributed Computing (PODC), pp. 81\u201389 (2000)","DOI":"10.1145\/343477.343523"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proc. of the 27th Ann. ACM Symp. on Theory of Computing, pp. 538\u2013547 (1995)","DOI":"10.1145\/225058.225271"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M.: Fast, wait-free (2k\u2009\u2212\u20091)-renaming. In: Proc. of the 18th Ann. ACM Symp. on Principles of Distributed Computing, pp. 105\u2013112 (1999)","DOI":"10.1145\/301308.301338"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M., Taubenfeld, G., Touitou, D.: Disentangling multi-object operations. In: Proc. of 16th Annual ACM Symp. on Principles of Distributed Computing, pp. 111\u2013120 (1997)","DOI":"10.1145\/259380.259431"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proc. of the 40th Ann. Symp. on Foundations of Computer Science, pp. 262\u2013272 (1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"issue":"2","key":"39_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s004460100060","volume":"15","author":"Y. Afek","year":"2002","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long Lived Adaptive Splitter and Applications. Distributed Computing\u00a015(2), 67\u201386 (2002)","journal-title":"Distributed Computing"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-39989-6_2","volume-title":"Distributed Computing","author":"M. Aguilera","year":"2003","unstructured":"Aguilera, M., Englert, B., Gafni, E.: Uniform Solvability with a finite number of MWMR registers. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol.\u00a02848, pp. 16\u201330. Springer, Heidelberg (2003)"},{"issue":"1","key":"39_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1006\/inco.1996.0006","volume":"124","author":"J. Anderson","year":"1996","unstructured":"Anderson, J., Yang, J.-H.: Time\/contention trade-offs for multiprocessor synchronization. Information and Computation\u00a0124(1), 68\u201384 (1996)","journal-title":"Information and Computation"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Attiya, H., Dagan, E.: Universal operations: Unary versus binary. In: Proc. 15th ACM Symp. on Principles of Distributed Computing, pp. 223\u2013232 (1996)","DOI":"10.1145\/248052.248097"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Attiya, H., Fouren, A.: Adaptive wait-free algorithms for lattice agreement and renaming. In: Proc. 17th ACM Symp. on Principles of Distr. Comp., pp. 277\u2013286 (1998)","DOI":"10.1145\/277697.277749"},{"issue":"4","key":"39_CR12","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 adaptive to point contention. J. ACM\u00a050(4), 444\u2013468 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"39_CR13","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":"39_CR14","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":"39_CR15","unstructured":"Attiya, H., Zach, I.: Fully adaptive algorithms for atomic and immediate snapshots (2003), www.cs.technion.ac.il\/hagit\/pubs\/AZ03.pdf"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Englert, B., Gafni, E.: Fast Collect in the Absence of Contention. In: Proc. 22nd IEEE Intern. Conference on Distr. Comp. Systems (ICDCS), pp. 537\u2013543 (2002)","DOI":"10.1109\/ICDCS.2002.1022303"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Englert, B., Goldstein, D.: Can Memory be used adaptively by Uniform Algorithms? In: Proc. 9th Intern. Conf. on Principles of Distr. Systems (OPODIS) (2005)","DOI":"10.1007\/11795490_5"},{"issue":"1","key":"39_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"Lamport, L.: A fast mutual exclusion algorithm. ACM Transactions on Computer Systems\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Transactions on Computer Systems"},{"key":"39_CR19","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0020-0190(93)90015-2","volume":"45","author":"M. Merritt","year":"1993","unstructured":"Merritt, M., Taubenfeld, G.: Speeding Lamport\u2019s fast mutual exclusion algorithm. Information Processing Letters\u00a045, 137\u2013142 (1993)","journal-title":"Information Processing Letters"},{"issue":"1","key":"39_CR20","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.: 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","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11946441_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T11:35:04Z","timestamp":1555932904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11946441_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540680673","9783540680703"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11946441_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}