{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:01:15Z","timestamp":1783576875353,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642415265","type":"print"},{"value":"9783642415272","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_20","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"284-298","source":"Crossref","is-referenced-by-count":14,"title":["An Optimal Implementation of Fetch-and-Increment"],"prefix":"10.1007","author":[{"given":"Faith","family":"Ellen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 538\u2013547 (1995)","DOI":"10.1145\/225058.225271"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects. In: Proceedings of the 12th SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 159\u2013170 (1993)","DOI":"10.1145\/164051.164071"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Aghazadeh, Z., Golab, W., Woelfel, P.: Brief announcement: Resettable objects and efficient memory reclamation for concurrent algorithms. In: Proceedings of the 32nd SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC) (2013)","DOI":"10.1145\/2484239.2484286"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Censor-Hillel, K., Gilbert, S., Zadimoghaddam, M.: Optimal-time adaptive strong renaming, with applications to counting. In: Proceedings of the 30th SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 239\u2013248 (2011)","DOI":"10.1145\/1993806.1993850"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/jagm.1996.0003","volume":"20","author":"J.F. Buss","year":"1996","unstructured":"Buss, J.F., Kanellakis, P.C., Ragde, P.L., Shvartsman, A.A.: Parallel algorithms with processor failures and delays. J. Algs.\u00a020, 45\u201386 (1996)","journal-title":"J. Algs."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-33651-5_2","volume-title":"Distributed Computing","author":"F. Ellen","year":"2012","unstructured":"Ellen, F., Ramachandran, V., Woelfel, P.: Efficient fetch-and-increment. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 16\u201330. Springer, Heidelberg (2012)"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: A time complexity lower bound for randomized implementations of some shared objects. In: Proceedings of the 9th SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 201\u2013210 (1998)","DOI":"10.1145\/277697.277735"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11795490_4","volume-title":"Principles of Distributed Systems","author":"P. Jayanti","year":"2006","unstructured":"Jayanti, P., Petrovic, S.: Efficiently implementing a large number of LL\/SC objects. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 17\u201331. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T18:40:23Z","timestamp":1558118423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}