{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:37:27Z","timestamp":1725705447364},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336508"},{"type":"electronic","value":"9783642336515"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33651-5_39","type":"book-chapter","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T09:25:32Z","timestamp":1352798732000},"page":"423-424","source":"Crossref","is-referenced-by-count":5,"title":["Brief Announcement: A Contention-Friendly, Non-blocking Skip List"],"prefix":"10.1007","author":[{"given":"Tyler","family":"Crain","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A contention-friendly, non-blocking skip list. Technical Report RR-7969, IRISA (May 2012)","DOI":"10.1007\/978-3-642-33651-5_39"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A speculation-friendly binary search tree. In: PPoPP (2012)","DOI":"10.1145\/2145816.2145837"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Fomitchev, M., Ruppert, E.: Lock-free linked lists and skip lists. In: PODC (2004)","DOI":"10.1145\/1011767.1011776"},{"key":"39_CR4","unstructured":"Fraser, K.: Practical lock freedom. PhD thesis. Cambridge University (September 2003)"},{"key":"39_CR5","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, p. 300. Springer, Heidelberg (2001)"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA, pp. 73\u201382 (2002)","DOI":"10.1145\/564870.564881"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM\u00a033 (June 1990)","DOI":"10.1145\/78973.78977"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Sundell, H., Tsigas, P.: Scalable and lock-free concurrent dictionaries. In: SAC (2004)","DOI":"10.1145\/967900.968188"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33651-5_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:12:38Z","timestamp":1606187558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33651-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336508","9783642336515"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33651-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}