{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:15:58Z","timestamp":1759335358616},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540100034"},{"type":"electronic","value":"9783540393467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1980]]},"DOI":"10.1007\/3-540-10003-2_72","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:59:09Z","timestamp":1330171149000},"page":"208-219","source":"Crossref","is-referenced-by-count":8,"title":["On the analysis of tree-matching algorithms"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"Jean-Marc","family":"Steyaert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"The average height of planted plane trees, in Graph Theory and Computing; R.C. Read Editor, Academic Press, New York, 1972, pp. 15\u201322.","DOI":"10.1016\/B978-1-4832-3187-7.50007-6"},{"key":"19_CR2","unstructured":"S\u00e9ries formelles reconnaissables d'arbres et applications, in 5o CLAAP, Lille (1980)."},{"key":"19_CR3","unstructured":"Analyse combinatoire, 2 vol., PUF, Paris, 1970."},{"key":"19_CR4","unstructured":"Analyse d'algorithmes de manipulation d'arbres et de fichiers, Th\u00e8se, Universit\u00e9 de Paris XI-Orsay, 1979."},{"key":"19_CR5","unstructured":"The Average height of binary trees and other simple trees, manuscript, 1980."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"The number of registers required for evaluating arithmetic expressions, Theoretic Comp. Sc. 9 (1979), pp. 99\u2013125.","DOI":"10.1016\/0304-3975(79)90009-4"},{"key":"19_CR7","unstructured":"Applied and computational complex analysis, 2 vol., J. Wiley & Sons, New York, 1978."},{"key":"19_CR8","unstructured":"The average number of registers to evaluate a binary tree optimally, Acta Informatica, 1979."},{"key":"19_CR9","unstructured":"The art of computer programming: fundamental algorithms, Addison Wesley, Reading, 1968."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"On the altitude of nodes in random trees, Can. J. Math. XXX, No 5 (1978), pp. 997\u20131015.","DOI":"10.4153\/CJM-1978-085-0"},{"key":"19_CR11","unstructured":"Kambinatorische Anzahlbestimmungen f\u00fcr Gruppen, Graphen und chemische Verbindungen, Acta Mathematica 68 (1937), pp. 145\u2013254."},{"key":"19_CR12","unstructured":"Functional composition patterns and power series reversion, Trans. A.M.S., 94 (1960), pp. 441\u2013451."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10003-2_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:02:19Z","timestamp":1605625339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10003-2_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980]]},"ISBN":["9783540100034","9783540393467"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-10003-2_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1980]]}}}