{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:49:42Z","timestamp":1649148582651},"reference-count":9,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"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":[[1996,9]]},"DOI":"10.1016\/0020-0190(96)00129-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:21:21Z","timestamp":1027606881000},"page":"309-315","source":"Crossref","is-referenced-by-count":0,"title":["A note on the expected path length of trees with known fringe"],"prefix":"10.1016","volume":"59","author":[{"given":"Roberto","family":"De Prisco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Parlati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00129-9_BIB1","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0166-218X(94)90034-5","article-title":"The maximal path length of binary trees","volume":"55","author":"Cameron","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(96)00129-9_BIB2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0020-0190(92)90038-W","article-title":"The internal path length of red black trees","volume":"42","author":"Cameron","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00129-9_BIB3","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(95)80033-6","article-title":"Minimal path length of trees with known fringe","volume":"143","author":"De Prisco","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00129-9_BIB4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1137\/S0097539791197323","article-title":"Tight upper and lower bounds on the path length of binary trees","volume":"23","author":"De Santis","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00129-9_BIB5","series-title":"Proc. STACS'91","first-page":"478","article-title":"Tight bounds on the path length of binary trees","volume":"480","author":"De Santis","year":"1991"},{"key":"10.1016\/0020-0190(96)00129-9_BIB6","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/62044.62048","article-title":"On the path length of binary trees","volume":"36","author":"Klein","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(96)00129-9_BIB7","series-title":"Information Processing","first-page":"449","article-title":"On binary trees","author":"Klein","year":"1989"},{"key":"10.1016\/0020-0190(96)00129-9_BIB8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(90)90037-I","article-title":"A tight upper bound for the path length of AVL tree","volume":"72","author":"Klein","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(96)00129-9_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321738.321739","article-title":"Upper bounds for the total path length of binary trees","volume":"20","author":"Nievergelt","year":"1973","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096001299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:24:31Z","timestamp":1556043871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096001299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["0020019096001299"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00129-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}