{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:43:37Z","timestamp":1649108617272},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":4460,"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":[[2001,5]]},"DOI":"10.1016\/s0166-218x(00)00250-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:49:17Z","timestamp":1027612157000},"page":"253-278","source":"Crossref","is-referenced-by-count":5,"title":["On the combinatorics of leftist trees"],"prefix":"10.1016","volume":"109","author":[{"given":"P.","family":"Nogueira","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00250-X_BIB1","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1137\/1016082","article-title":"Asymptotic methods in enumeration","volume":"16","author":"Bender","year":"1974","journal-title":"SIAM Rev."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB2","unstructured":"C.A. Crane, Linear lists and priority queues as balanced binary trees, Technical Report STAN-CS-72-259, Stanford University, 1972."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB3","unstructured":"M. Drmota, The asymptotic number of leftist trees, preprint, Technical University of Vienna, 1999."},{"key":"10.1016\/S0166-218X(00)00250-X_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\/S0166-218X(00)00250-X_BIB5","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1073\/pnas.42.8.529","article-title":"Combinatorial problems in the theory of graphs, III","volume":"42","author":"Ford","year":"1956","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB6","series-title":"Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/S0166-218X(00)00250-X_BIB7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1017\/S1446788700016190","article-title":"Twenty-step algorithm for determining the asymptotic number of trees of various species","volume":"20 (Series A)","author":"Harary","year":"1975","journal-title":"J. Austral. Math. Soc."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB8","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(87)90165-7","article-title":"A note on the number of leftist trees","volume":"25","author":"Kemp","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB9","series-title":"Random Graphs \u201987","first-page":"103","article-title":"Further results on leftist trees","author":"Kemp","year":"1990"},{"key":"10.1016\/S0166-218X(00)00250-X_BIB10","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1007\/BF00289158","article-title":"The expected additive weight of trees","volume":"26","author":"Kemp","year":"1989","journal-title":"Acta Inform."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB11","first-page":"313","article-title":"On leftist simply generated trees","volume":"4","author":"Kemp","year":"1999","journal-title":"J. Automat. Languages Combin."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB12","series-title":"The Art of Computer Programming, Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/S0166-218X(00)00250-X_BIB13","series-title":"The Art of Computer Programming, Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0166-218X(00)00250-X_BIB14","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":"Can. J. Math."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB15","series-title":"Handbook of Combinatorics","first-page":"1063","article-title":"Asymptotic enumeration methods","author":"Odlyzko","year":"1995"},{"key":"10.1016\/S0166-218X(00)00250-X_BIB16","doi-asserted-by":"crossref","first-page":"583","DOI":"10.2307\/1969046","article-title":"The number of trees","volume":"49","author":"Otter","year":"1948","journal-title":"Ann. Math."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02546665","article-title":"Kombinatorische Anzahlbestimmungen f\u00fcr Gruppen, Graphen und Chemisch Verbindungen","volume":"68","author":"P\u00f3lya","year":"1937","journal-title":"Acta Math."},{"key":"10.1016\/S0166-218X(00)00250-X_BIB18","series-title":"Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds","author":"P\u00f3lya","year":"1987"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000250X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0000250X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T02:20:08Z","timestamp":1555899608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0000250X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0166218X0000250X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00250-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}