{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:20:12Z","timestamp":1754108412944,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T00:00:00Z","timestamp":1568592000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T00:00:00Z","timestamp":1568592000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","award":["96236"],"award-info":[{"award-number":["96236"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["GJ16-07822Y"],"award-info":[{"award-number":["GJ16-07822Y"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00453-019-00622-4","type":"journal-article","created":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T05:02:57Z","timestamp":1568610177000},"page":"642-679","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Central Limit Theorem for Almost Local Additive Tree Functionals"],"prefix":"10.1007","volume":"82","author":[{"given":"Dimbinaina","family":"Ralaivaosaona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matas","family":"\u0160ileikis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5533-2764","authenticated-orcid":false,"given":"Stephan","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"key":"622_CR1","volume-title":"Convergence of Probability Measures","author":"P Billingsley","year":"1968","unstructured":"Billingsley, P.: Convergence of Probability Measures. Wiley, New York (1968)"},{"key":"622_CR2","first-page":"273","volume":"35","author":"D Br\u00f3d","year":"2006","unstructured":"Br\u00f3d, D., Skupie\u0144, Z.: Trees with extremal numbers of dominating sets. Australas. J. Comb. 35, 273\u2013290 (2006)","journal-title":"Australas. J. Comb."},{"key":"622_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-211-75357-6","volume-title":"Random Trees: An Interplay Between Combinatorics and Probability","author":"M Drmota","year":"2009","unstructured":"Drmota, M.: Random Trees: An Interplay Between Combinatorics and Probability. Springer, Berlin (2009)"},{"issue":"2","key":"622_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00010-017-0529-0","volume":"92","author":"B Hackl","year":"2018","unstructured":"Hackl, B., Heuberger, C., Kropf, S., Prodinger, H.: Fringe analysis of plane trees related to cutting and pruning. Aequ. Math. 92(2), 311\u2013353 (2018)","journal-title":"Aequ. Math."},{"issue":"4","key":"622_CR5","first-page":"1","volume":"20","author":"C Holmgren","year":"2015","unstructured":"Holmgren, C., Janson, S.: Limit laws for functions of fringe trees for binary search trees and random recursive trees. Electron. J. Probab. 20(4), 1\u201351 (2015)","journal-title":"Electron. J. Probab."},{"issue":"2","key":"622_CR6","first-page":"49","volume":"24","author":"C Holmgren","year":"2017","unstructured":"Holmgren, C., Janson, S., \u0160ileikis, M.: Multivariate normal limit laws for the numbers of fringe subtrees in $$m$$-ary search trees and preferential attachment trees. Electron. J. Comb. 24(2), 49 (2017)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"622_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/rsa.20086","volume":"29","author":"S Janson","year":"2006","unstructured":"Janson, S.: Random cutting and records in deterministic and random trees. Random Struct. Algorithms 29(2), 139\u2013179 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"622_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1214\/11-PS188","volume":"9","author":"S Janson","year":"2012","unstructured":"Janson, S.: Simply generated trees, conditioned Galton\u2013Watson trees, random allocations and condensation. Probab. Surv. 9, 103\u2013252 (2012)","journal-title":"Probab. Surv."},{"issue":"1","key":"622_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/rsa.20568","volume":"48","author":"S Janson","year":"2016","unstructured":"Janson, S.: Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton\u2013Watson trees. Random Struct. Algorithms 48(1), 57\u2013101 (2016)","journal-title":"Random Struct. Algorithms"},{"key":"622_CR10","volume-title":"Foundations of Modern Probability. Probability and its Applications (New York)","author":"O Kallenberg","year":"2002","unstructured":"Kallenberg, O.: Foundations of Modern Probability. Probability and its Applications (New York), 2nd edn. Springer, New York (2002)","edition":"2"},{"issue":"4","key":"622_CR11","first-page":"425","volume":"22","author":"H Kesten","year":"1986","unstructured":"Kesten, H.: Subdiffusive behavior of random walk on a random cluster. Ann. Inst. Henri Poincar\u00e9 Probab. Stat. 22(4), 425\u2013487 (1986)","journal-title":"Ann. Inst. Henri Poincar\u00e9 Probab. Stat."},{"key":"622_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-94-009-4311-7_8","volume-title":"Fibonacci Numbers and Their Applications (Patras 1984) of Applied mathematics","author":"P Kirschenhofer","year":"1986","unstructured":"Kirschenhofer, P., Prodinger, H., Tichy, R.F.: Fibonacci numbers of graphs. III. Planted plane trees. Fibonacci Numbers and Their Applications (Patras 1984) of Applied mathematics, vol. 28, pp. 105\u2013120. Reidel, Dordrecht (1986)"},{"issue":"2","key":"622_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1006\/eujc.1995.0095","volume":"18","author":"M Klazar","year":"1997","unstructured":"Klazar, M.: Twelve countings with rooted plane trees. Eur. J. Comb. 18(2), 195\u2013210 (1997)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"622_CR14","first-page":"16","volume":"20","author":"H Prodinger","year":"1982","unstructured":"Prodinger, H., Tichy, R.F.: Fibonacci numbers of graphs. Fibonacci Q. 20(1), 16\u201321 (1982)","journal-title":"Fibonacci Q."},{"key":"622_CR15","unstructured":"Ralaivaosaona, D., \u0160ileikis, M., Wagner, S.: Asymptotic normality of almost local functionals in conditioned Galton\u2013Watson trees. In: 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, vol. 110 of LIPIcs. Leibniz International Proceedings in Informatics, Art. No. 33, pp. 17. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, (2018)"},{"issue":"4","key":"622_CR16","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1017\/S0963548318000585","volume":"28","author":"Dimbinaina Ralaivaosaona","year":"2019","unstructured":"Ralaivaosaona, D., Wagner, S.: A central limit theorem for additive functionals of increasing trees. Comb. Probab. Comput. 28(4), 618\u2013637 (2019)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"4","key":"622_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1155\/S1048953391000217","volume":"4","author":"L Tak\u00e1cs","year":"1991","unstructured":"Tak\u00e1cs, L.: Conditional limit theorems for branching processes. J. Appl. Math. Stoch. Anal. 4(4), 263\u2013292 (1991)","journal-title":"J. Appl. Math. Stoch. Anal."},{"issue":"1","key":"622_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/050631446","volume":"21","author":"S Wagner","year":"2007","unstructured":"Wagner, S.: Correlation of graph-theoretical indices. SIAM J. Discrete Math. 21(1), 33\u201346 (2007)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"622_CR19","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1016\/j.ejc.2006.01.014","volume":"28","author":"S Wagner","year":"2007","unstructured":"Wagner, S.: On the number of matchings of a tree. Eur. J. Comb. 28(4), 1322\u20131330 (2007)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"622_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1017\/S0963548314000443","volume":"24","author":"S Wagner","year":"2015","unstructured":"Wagner, S.: Central limit theorems for additive tree parameters with small toll functions. Comb. Probab. Comput. 24(1), 329\u2013353 (2015)","journal-title":"Comb. Probab. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00622-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00622-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00622-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T23:08:51Z","timestamp":1600124931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00622-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,16]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["622"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00622-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,9,16]]},"assertion":[{"value":"30 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}