{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:19:45Z","timestamp":1717597185336},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"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":9543,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1016\/0012-365x(87)90137-3","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"149-156","source":"Crossref","is-referenced-by-count":22,"title":["Level number sequences for trees"],"prefix":"10.1016","volume":"65","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90137-3_BIB1","article-title":"The Theory of Partitions","volume":"Vol 2","author":"Andrews","year":"1976"},{"key":"10.1016\/0012-365X(87)90137-3_BIB2","first-page":"25","article-title":"Level number sequences for binary trees","author":"Clowes","year":"1977","journal-title":"University of Newcastle Computing La. Res. Rep. 112"},{"key":"10.1016\/0012-365X(87)90137-3_BIB3","first-page":"72","article-title":"Mathematical methods in the analysis of algorithms and data structures","author":"Flajolet","year":"1985"},{"key":"10.1016\/0012-365X(87)90137-3_BIB4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","article-title":"The average height of binary trees and other simple trees","volume":"25","author":"Flajolet","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(87)90137-3_BIB5","series-title":"Combinatorial Enumerations","author":"Jackson","year":"1983"},{"key":"10.1016\/0012-365X(87)90137-3_BIB6","series-title":"Applied and Computational Complex Analysis","author":"Henrici","year":"1974"},{"key":"10.1016\/0012-365X(87)90137-3_BIB7","series-title":"The Art of Computer Programming: Fundamental Algorithms","author":"Knuth","year":"1968"},{"key":"10.1016\/0012-365X(87)90137-3_BIB8","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","article-title":"On the Altitude of Nodes in Random Trees","volume":"30","author":"Meir","year":"1978","journal-title":"Canad J. Math."},{"key":"10.1016\/0012-365X(87)90137-3_BIB9","series-title":"Bandwidths and profiles of trees","author":"Odlyzko","year":"1984"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901373?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901373?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:54:37Z","timestamp":1553946877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X87901373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0012365X87901373"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90137-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}