{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:18:51Z","timestamp":1725887931447},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596464"},{"type":"electronic","value":"9783319596471"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59647-1_30","type":"book-chapter","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T22:53:30Z","timestamp":1494629610000},"page":"405-420","source":"Crossref","is-referenced-by-count":1,"title":["Sequential Proximity"],"prefix":"10.1007","author":[{"given":"Karolos","family":"Antoniadis","sequence":"first","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"Julien","family":"Stainer","sequence":"additional","affiliation":[]},{"given":"Vasileios","family":"Trigonakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Antoniadis, K., Guerraoui, R., Stainer, J., Trigonakis, V.: Sequential proximity: towards provably scalable concurrent search algorithms. Technical report, EPFL (2017)","DOI":"10.1007\/978-3-319-59647-1_30"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P. Michael, M.M., Vechev, M.T.: Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. In: POPL (2011)","DOI":"10.1145\/1926385.1926442"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A Practical Concurrent Binary Search Tree. In: PPopp (2010)","DOI":"10.1145\/1693453.1693488"},{"key":"30_CR4","unstructured":"David, T., Guerraoui, R., Trigonakis, V., Concurrency, A.: The secret to scaling concurrent search data structures. In: ASPLOS (2015)"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Ellen, F., Fatourou, P., Ruppert, E., van Breugel, F.: Non-blocking binary search trees. In: PODC (2010)","DOI":"10.1145\/1835698.1835736"},{"key":"30_CR6","unstructured":"Facebook: RocksDB. http:\/\/rocksdb.org"},{"key":"30_CR7","unstructured":"Fraser, K.: Practical lock-freedom. Ph.D. thesis, University of Cambridge (2004)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Trigonakis, V.: Optimistic concurrency with OPTIK. In: PPopp (2016)","DOI":"10.1145\/2851141.2851146"},{"key":"30_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":"TL Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300\u2013314. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45414-4_21"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11795490_3","volume-title":"Principles of Distributed Systems","author":"S Heller","year":"2006","unstructured":"Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer, W.N., Shavit, N.: A lazy concurrent list-based set algorithm. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 3\u201316. Springer, Heidelberg (2006). doi: 10.1007\/11795490_3"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Herlihy, M.: Wait-free synchronization. In: TOPLAS (1991)","DOI":"10.1145\/114005.102808"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Wing, J.: Linearizability: a correctness condition for concurrent objects. In: TOPLAS (1990)","DOI":"10.1145\/78969.78972"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-72951-8_11","volume-title":"Structural Information and Communication Complexity","author":"M Herlihy","year":"2007","unstructured":"Herlihy, M., Lev, Y., Luchangco, V., Shavit, N.: A simple optimistic skiplist algorithm. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 124\u2013138. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72951-8_11"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Howley, S.V., Jones, J.: A non-blocking internal binary search tree. In: SPAA (2012)","DOI":"10.1145\/2312005.2312036"},{"key":"30_CR15","unstructured":"Linux Kernel: Linux Kernel. https:\/\/www.kernel.org"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Matveev, A., Shavit, N., Felber, P., Marlier, P.: Read-log-update: a lightweight synchronization mechanism for concurrent programming. In: SOSP (2015)","DOI":"10.1145\/2815400.2815406"},{"key":"30_CR17","unstructured":"McKenney, P.E., Slingwine, J.D.: Read-copy update: using execution history to solve concurrency problems. In: PDCS (1998)"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Pugh, W., Lists, S.: A probabilistic alternative to balanced trees. In: CACM (1990)","DOI":"10.1007\/3-540-51542-9_36"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T11:58:29Z","timestamp":1569326309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}