{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:23:36Z","timestamp":1648621416977},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0020-0190(94)00150-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"253-257","source":"Crossref","is-referenced-by-count":2,"title":["Linear-time construction of treaps and Cartesian trees"],"prefix":"10.1016","volume":"52","author":[{"given":"Mark Allen","family":"Weiss","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00150-2_BIB1","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/SFCS.1989.63531","article-title":"Randomized search trees","author":"Aragon","year":"1989","journal-title":"Proc. 30th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)00150-2_BIB2","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/SFCS.1992.267820","article-title":"Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues","author":"Buchsbaum","year":"1992","journal-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)00150-2_BIB3","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1137\/0221057","article-title":"New results on dynamic planar point location","volume":"21","author":"Cheng","year":"1992","journal-title":"SIAM J. Comput."},{"issue":"12","key":"10.1016\/0020-0190(94)00150-2_BIB4","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","article-title":"Algorithm 245: Treesort","volume":"7","author":"Floyd","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(94)00150-2_BIB5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(86)90028-1","article-title":"Deques with heap order","volume":"22","author":"Gajewska","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00150-2_BIB6","first-page":"195","article-title":"An optimal RAM implementation of catenable min double-ended queues","author":"Kosaraju","year":"1994","journal-title":"Proc. 5th ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0020-0190(94)00150-2_BIB7","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1137\/0218079","article-title":"Solution of a divide-and-conquer maximin recurrence","volume":"18","author":"Li","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00150-2_BIB8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","article-title":"Priority search trees","volume":"14","author":"McCreight","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00150-2_BIB9","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","article-title":"Self adjusting binary search trees","volume":"32","author":"Sleator","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)00150-2_BIB10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","article-title":"A Unifying look at data structures","volume":"23","author":"Vuillemin","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(94)00150-2_BIB11","series-title":"Data Structures and Algorithm Analysis","author":"Weiss","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001502?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001502?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:52:33Z","timestamp":1555145553000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0020019094001502"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00150-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}