{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:40:55Z","timestamp":1775122855424,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319654812","type":"print"},{"value":"9783319654829","type":"electronic"}],"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-65482-9_63","type":"book-chapter","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T14:08:09Z","timestamp":1502374089000},"page":"776-790","source":"Crossref","is-referenced-by-count":4,"title":["Concurrent Treaps"],"prefix":"10.1007","author":[{"given":"Praveen","family":"Alapati","sequence":"first","affiliation":[]},{"given":"Swamy","family":"Saranam","sequence":"additional","affiliation":[]},{"given":"Madhu","family":"Mutyam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,11]]},"reference":[{"key":"63_CR1","unstructured":"Java programming. \nhttps:\/\/en.wikibooks.org\/wiki\/Java_Programming"},{"key":"63_CR2","unstructured":"Perf tool. \nhttps:\/\/perf.wiki.kernel.org\/index.php"},{"key":"63_CR3","unstructured":"Reentrant locks. \nhttp:\/\/docs.oracle.com\/java7\/api\/"},{"key":"63_CR4","unstructured":"Synchrobench. \nhttps:\/\/github.com\/gramoli\/synchrobench"},{"issue":"6","key":"63_CR5","first-page":"393","volume":"27","author":"Y Afek","year":"2014","unstructured":"Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A., Tarjan, R.E.: Cbtree: a practical concurrent self-adjusting search tree. DISC 27(6), 393\u2013417 (2014)","journal-title":"DISC"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"Aragon, C.R., Seidel, R.G.: Randomized search trees. In: FOCS, pp. 450\u2013454 (1989)","DOI":"10.1109\/SFCS.1989.63531"},{"key":"63_CR7","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Reid-Miller, M.: Fast set operations using treaps. In: SPAA, pp. 16\u201326 (1998)","DOI":"10.1145\/277651.277660"},{"key":"63_CR8","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\/1693453.1693488"},{"key":"63_CR9","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A contention-friendly binary search tree. In: ICPP, pp. 229\u2013240 (2013)","DOI":"10.1007\/978-3-642-40047-6_25"},{"key":"63_CR10","doi-asserted-by":"crossref","unstructured":"Drachsler, D., Vechev, M., Yahav, E.: Practical concurrent binary search trees via logical ordering. In: PPoPP, pp. 343\u2013356 (2014)","DOI":"10.1145\/2555243.2555269"},{"key":"63_CR11","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":"63_CR12","unstructured":"Fraser: Practical lock freedom. Ph.D. thesis, University of Cambridge (2003)"},{"key":"63_CR13","volume-title":"The Art of Multiprocessor Programming","author":"MP Herlihy","year":"2008","unstructured":"Herlihy, M.P., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers, San Francisco (2008)"},{"issue":"3","key":"63_CR14","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. TOPLAS 12(3), 463\u2013492 (1990)","journal-title":"TOPLAS"},{"key":"63_CR15","unstructured":"Lea, D.: Concurrent skip list (2005)"},{"issue":"2","key":"63_CR16","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1145\/274787.274812","volume":"45","author":"C Mart\u00ednez","year":"1998","unstructured":"Mart\u00ednez, C., Roura, S.: Randomized binary search trees. JACM 45(2), 288\u2013323 (1998)","journal-title":"JACM"},{"key":"63_CR17","doi-asserted-by":"crossref","unstructured":"Natarajan, A., Mittal, N.: Fast concurrent lock-free binary search trees. In: PPoPP, pp. 317\u2013328 (2014)","DOI":"10.1145\/2555243.2555256"},{"issue":"6","key":"63_CR18","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. CACM 33(6), 668\u2013676 (1990)","journal-title":"CACM"},{"key":"63_CR19","volume-title":"Java Enterprise Performance","author":"A Reitbauer","year":"2011","unstructured":"Reitbauer, A.: Java Enterprise Performance. entwickler Press, Frankfurt (2011)"},{"issue":"3","key":"63_CR20","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/1897852.1897873","volume":"54","author":"N Shavit","year":"2011","unstructured":"Shavit, N.: Data structures in the multicore age. CACM 54(3), 76\u201384 (2011)","journal-title":"CACM"},{"key":"63_CR21","volume-title":"Data Structures and Algorithm Analysis in C++","author":"MA Weiss","year":"2009","unstructured":"Weiss, M.A.: Data Structures and Algorithm Analysis in C++, 3rd edn. Pearson Press, Boston (2009)","edition":"3"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-65482-9_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T14:30:29Z","timestamp":1502375429000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65482-9_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319654812","9783319654829"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65482-9_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}