{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T00:52:16Z","timestamp":1698022336658},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,7,1]],"date-time":"1988-07-01T00:00:00Z","timestamp":583718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9147,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1988,7]]},"DOI":"10.1016\/0166-218x(88)90080-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"243-251","source":"Crossref","is-referenced-by-count":11,"title":["On the joint distribution of the insertion path length and the number of comparisons in search trees"],"prefix":"10.1016","volume":"20","author":[{"given":"Hosam M.","family":"Mahmoud","sequence":"first","affiliation":[]},{"given":"Boris","family":"Pittel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90080-7_BIB1","first-page":"345","volume":"4","author":"Muntz","year":"1970","journal-title":"Proc. Princeton Conf. on Inf. Sciences and Systems"},{"key":"10.1016\/0166-218X(88)90080-7_BIB2","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0166-218X(88)90080-7_BIB3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1137\/0605010","article-title":"On the most probable shape of a search tree grown from a random permutation","volume":"1","author":"Mahmoud","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(88)90080-7_BIB4","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/0022-247X(84)90141-0","article-title":"On growing random binary trees","volume":"103","author":"Pittel","year":"1984","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0166-218X(88)90080-7_BIB5","volume":"Vol. 1","author":"Feller","year":"1970"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900807?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88900807?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:54:15Z","timestamp":1555134855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88900807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,7]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,7]]}},"alternative-id":["0166218X88900807"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90080-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,7]]}}}