{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T07:24:49Z","timestamp":1777965889756,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540363217","type":"print"},{"value":"9783540363224","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11795490_3","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T12:25:18Z","timestamp":1169555118000},"page":"3-16","source":"Crossref","is-referenced-by-count":114,"title":["A Lazy Concurrent List-Based Set Algorithm"],"prefix":"10.1007","author":[{"given":"Steve","family":"Heller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Luchangco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Moir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"William N.","family":"Scherer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"Bayer, R., Schkolnick, M.: Concurrency of operations on b-trees. Acta Informatica\u00a09, 1\u201321 (1977)","journal-title":"Acta Informatica"},{"key":"3_CR2","unstructured":"Eckel, B.: Thinking in Java, 2nd edn. Pearson Education (2000)"},{"key":"3_CR3","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. Harris","year":"2001","unstructured":"Harris, T.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 300\u2013314. Springer, Heidelberg (2001)"},{"issue":"1","key":"3_CR4","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":"3_CR5","first-page":"339","volume-title":"Proceedings of the 16th International Symposium on Distributed Computing","author":"M. Herlihy","year":"2002","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. In: Proceedings of the 16th International Symposium on Distributed Computing, vol.\u00a02508, pp. 339\u2013353. Springer, Heidelberg (2002)"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR7","unstructured":"Lea, D.: Personal communication"},{"key":"3_CR8","volume-title":"Concurrent Programming in Java(TM): Design Principles and Patterns","author":"D. Lea","year":"1999","unstructured":"Lea, D.: Concurrent Programming in Java(TM): Design Principles and Patterns, 2nd edn. Addison-Wesley, Reading (1999)","edition":"2"},{"key":"3_CR9","volume-title":"Hello Laziness: Why Hard Work Doesn\u2019t Pay","author":"C. Maier","year":"2005","unstructured":"Maier, C.: Hello Laziness: Why Hard Work Doesn\u2019t Pay. Orion, London (2005)"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/564870.564881","volume-title":"Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures","author":"M. Michael","year":"2002","unstructured":"Michael, M.: High performance dynamic lock-free hash tables and list-based sets. In: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pp. 73\u201382. ACM Press, New York (2002)"},{"key":"3_CR11","first-page":"21","volume-title":"The 21st Annual ACM Symposium on Principles of Distributed Computing","author":"M. Michael","year":"2002","unstructured":"Michael, M.: Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In: The 21st Annual ACM Symposium on Principles of Distributed Computing, pp. 21\u201330. ACM Press, New York (2002)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Moir, M., Shavit, N.: Chapter 47 \u2013 Concurrent Data Structures \u2013 Handbook of Data Structures and Applications, 1st edn. Chapman and Hall\/CRC (2004)","DOI":"10.1201\/9781420035179.ch47"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Vafeiadis, V., Herlihy, M., Hoare, T., Shapiro, M.: Proving correctness of highly-concurrent linearisable objects. Technical report, Microsoft Research, Cambridge, UK (2005)","DOI":"10.1145\/1122971.1122992"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Valois, J.: Lock-free linked lists using compare-and-swap. In: ACM Symposium on Principles of Distributed Computing, pp. 214\u2013222 (1995)","DOI":"10.1145\/224964.224988"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,8]],"date-time":"2021-08-08T00:52:56Z","timestamp":1628383976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11795490_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}