{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:13:55Z","timestamp":1649038435610},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,11,6]],"date-time":"2002-11-06T00:00:00Z","timestamp":1036540800000},"content-version":"vor","delay-in-days":2685,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0304-3975(95)80033-6","type":"journal-article","created":{"date-parts":[[2011,5,31]],"date-time":"2011-05-31T20:06:15Z","timestamp":1306872375000},"page":"175-188","source":"Crossref","is-referenced-by-count":3,"title":["Minimal path length of trees with known fringe"],"prefix":"10.1016","volume":"143","author":[{"given":"Roberto","family":"De Prisco","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Parlati","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)80033-6_BIB1","unstructured":"H. Cameron and D. Wood, The maximal path length of binary trees, manuscript."},{"key":"10.1016\/0304-3975(95)80033-6_BIB2","series-title":"Proc. 8th Ann. Symp. on Theoretical Aspects of Computer Science (STACS'91)","first-page":"478","article-title":"Tight bounds on the path length of binary trees","volume":"Vol. 480","author":"De Santis","year":"1991"},{"key":"10.1016\/0304-3975(95)80033-6_BIB3","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\/0304-3975(95)80033-6_BIB4","author":"Hamming","year":"1980"},{"key":"10.1016\/0304-3975(95)80033-6_BIB5","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\/0304-3975(95)80033-6_BIB6","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 trees","volume":"72","author":"Klein","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)80033-6_BIB7","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800336?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595800336?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,2,11]],"date-time":"2022-02-11T12:32:11Z","timestamp":1644582731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595800336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0304397595800336"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)80033-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}