{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:13:33Z","timestamp":1779174813421,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_16","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"224-238","source":"Crossref","is-referenced-by-count":27,"title":["Lock-Free Data-Structure Iterators"],"prefix":"10.1007","author":[{"given":"Erez","family":"Petrank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahar","family":"Timnat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Dolev, D., Attiya, H., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. In: PODC, pp. 1\u201313 (1990)","DOI":"10.21236\/ADA222765"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-04355-0_11","volume-title":"Distributed Computing","author":"Y. Afek","year":"2009","unstructured":"Afek, Y., Shavit, N., Tzafrir, M.: Interrupting snapshots and the java $^{\\mbox{\\tiny TM}}$ size() method. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 78\u201392. Springer, Heidelberg (2009)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, J.H.: Multi-writer composite registers, pp. 175\u2013195 (1994)","DOI":"10.1007\/BF02280833"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Braginsky, A., Petrank, E.: A lock-free b+tree. In: SPAA, pp. 58\u201367 (2012)","DOI":"10.1145\/2312005.2312016"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A practical concurrent binary search tree. In: PPOPP, pp. 257\u2013268 (2010)","DOI":"10.1145\/1837853.1693488"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Ellen, F., Fatourou, P., Ruppert, E., van Breugel, F.: Non-blocking binary search trees. In: PODC, pp. 131\u2013140 (2010)","DOI":"10.1145\/1835698.1835736"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Kallimanis, N.D.: Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using cas. In: PODC, pp. 33\u201342 (2007)","DOI":"10.1145\/1281100.1281108"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1011767.1011776","volume-title":"Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004","author":"M. Fomitchev","year":"2004","unstructured":"Fomitchev, M., Ruppert, E.: Lock-free linked lists and skip lists. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, pp. 50\u201359. ACM, New York (2004)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","volume-title":"Distributed Computing","author":"T.L. Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 300\u2013314. Springer, Heidelberg (2001)"},{"key":"16_CR10","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2008)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Jayanti, P.: An optimal multi-writer snapshot algorithm. In: STOC, pp. 723\u2013732 (2005)","DOI":"10.1145\/1060590.1060697"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proc. ACM Symposium on Principles of Distributed Computing (PODC), pp. 267\u2013275 (1996)","DOI":"10.1145\/248052.248106"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Prokopec, A., Bronson, N.G., Bagwell, P., Odersky, M.: Concurrent tries with efficient non-blocking snapshots. In: PPOPP, pp. 151\u2013160 (2012)","DOI":"10.1145\/2370036.2145836"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Riany, Y., Shavit, N., Touitou, D., Touitou, D.: Towards a practical snapshot algorithm. In: ISTCS, pp. 121\u2013129 (1995)","DOI":"10.1109\/ISTCS.1995.377039"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Timnat, S., Braginsky, A., Kogan, A., Petrank, E.: Wait-free linked-lists. In: PPOPP, pp. 309\u2013310 (2012)","DOI":"10.1145\/2370036.2145869"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T15:27:27Z","timestamp":1746026847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}