{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:22:58Z","timestamp":1649215378886},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":[[1991,12]]},"DOI":"10.1016\/0020-0190(91)90123-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"277-281","source":"Crossref","is-referenced-by-count":0,"title":["Expected time analysis of interpolation merge \u2014 a simple new merging algorithm"],"prefix":"10.1016","volume":"40","author":[{"given":"Sumanta","family":"Guha","sequence":"first","affiliation":[]},{"given":"Arunabha","family":"Sen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90123-Y_BIB1","first-page":"259","article-title":"Improving the bounds on optimal merging","author":"Christen","year":"1978","journal-title":"Proc. 19th IEEE FOCS"},{"key":"10.1016\/0020-0190(91)90123-Y_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0201004","article-title":"A simple algorithm for merging two disjoint linearly ordered sets","volume":"1","author":"Hwang","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(91)90123-Y_BIB3","series-title":"The Art of Computer Programming, Vol. 1, Fundamenatal Algorithms","author":"Knuth","year":"1968"},{"key":"10.1016\/0020-0190(91)90123-Y_BIB4","series-title":"The Art of Computer Programming, Vol. 3, Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(91)90123-Y_BIB5","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/322139.322144","article-title":"Significant improvements to the Hwang-Lin merging algorithm","volume":"26","author":"Manacher","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(91)90123-Y_BIB6","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/BF01934409","article-title":"An improvement of the binary merge algorithm","volume":"22","author":"Thanh","year":"1982","journal-title":"BIT"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190123Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190123Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:25:40Z","timestamp":1555129540000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190123Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["002001909190123Y"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90123-y","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}