{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:44:52Z","timestamp":1777520692636,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540108283","type":"print"},{"value":"9783540387169","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10828-9_62","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:25:32Z","timestamp":1330190732000},"page":"180-193","source":"Crossref","is-referenced-by-count":5,"title":["Applied tree enumerations"],"prefix":"10.1007","author":[{"given":"Nachum","family":"Dershowitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"12_CR1","unstructured":"K. Brinck and N. Y. Foo [1981], Analysis of algorithms on threaded trees, to appear in Comp. J."},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/B978-1-4832-3187-7.50007-6","volume-title":"Graph Theory and Computing","author":"N. deBruijn","year":"1972","unstructured":"N. deBruijn, D. E. Knuth, and O. Rice [1972], The average height of planted plane trees, in Graph Theory and Computing (R. C. Read, ed.), Academic Press, New York, 15\u201322."},{"issue":"2","key":"12_CR3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/comjnl\/23.2.161","volume":"23","author":"B. Dasarathy","year":"1980","unstructured":"B. Dasarathy and C. Yang [1980], A transformation on ordered trees, Comp. J. 23 (2), 161\u2013164.","journal-title":"Comp. J."},{"key":"12_CR4","unstructured":"N. Dershowitz [1981], Orderings for term-rewriting systems, to appear in J. Theoretical Computer Science."},{"issue":"1","key":"12_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(80)90168-5","volume":"31","author":"N. Dershowitz","year":"1980","unstructured":"N. Dershowitz and S. Zaks [1980], Enumerations of ordered trees, Discrete Math. 31 (1), 9\u201328.","journal-title":"Discrete Math."},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1215\/S0012-7094-47-01423-3","volume":"14","author":"A. Dvoretzky","year":"1947","unstructured":"A. Dvoretzky and Th. Motzkin [1947], A problem of arrangements, Duke Math. J. 14, 305\u2013313.","journal-title":"Duke Math. J."},{"key":"12_CR7","first-page":"7","volume":"32","author":"A. Erdelyi","year":"1940","unstructured":"A. Erdelyi and I. M. H. Etherington [1940], Some problems of non-associative combinations (2), Edin. Math. Notes 32, 7\u201312.","journal-title":"Edin. Math. Notes"},{"key":"12_CR8","first-page":"208","volume-title":"On the analysis of tree-matching algorithms, Proc. 7th Intl. Conf. Automata","author":"P. Flajolet","year":"1980","unstructured":"Ph. Flajolet and J. M. Steyaert [1980], On the analysis of tree-matching algorithms, Proc. 7th Intl. Conf. Automata, Languages and Programming, Amsterdam, 208\u2013220."},{"issue":"6","key":"12_CR9","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1038\/scientificamerican0676-120","volume":"234","author":"M. Gardner","year":"1976","unstructured":"M. Gardner [1976], Mathematical games: Catalan numbers, Scientific American 234 (6), 120\u2013125.","journal-title":"Scientific American"},{"key":"12_CR10","volume-title":"The Art of Computer Programming, Vol. 1: Fundamental algorithms","author":"D. E. Knuth","year":"1968","unstructured":"D. E. Knuth [1968], The Art of Computer Programming, Vol. 1: Fundamental algorithms, Addison-Wesley, Reading, MA."},{"key":"12_CR11","volume-title":"Catalan structures and correspondences","author":"M. J. Kuchinski","year":"1977","unstructured":"M. J. Kuchinski [1977], Catalan structures and correspondences, M.S. Thesis, Dept. of Mathematics, West Virginia Univ., Morgantown, WV."},{"issue":"5","key":"12_CR12","doi-asserted-by":"crossref","first-page":"997","DOI":"10.4153\/CJM-1978-085-0","volume":"30","author":"A. Meir","year":"1978","unstructured":"A. Meir and J. Moon [1978], On the altitude of nodes in random trees, Can. J. Math. 30 (5), 997\u20131015.","journal-title":"Can. J. Math."},{"key":"12_CR13","volume-title":"Lattice Path Counting and Applications","author":"S. G. Mohanty","year":"1979","unstructured":"S. G. Mohanty [1979], Lattice Path Counting and Applications, Academic Press, New York."},{"key":"12_CR14","first-page":"91","volume":"21","author":"T. V. Narayana","year":"1959","unstructured":"T. V. Narayana [1959], A partial order and its applications to probability, Sankhya 21, 91\u201398.","journal-title":"Sankhya"},{"key":"12_CR15","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1090\/S0002-9947-1960-0114765-9","volume":"94","author":"G. H. Raney","year":"1960","unstructured":"G. H. Raney [1960], Functional composition patterns and power series reversion, Trans. AMS 94, 441\u2013451.","journal-title":"Trans. AMS"},{"key":"12_CR16","volume-title":"Combinatorial Identities","author":"J. Riordan","year":"1968","unstructured":"J. Riordan [1968], Combinatorial Identities, Wiley, New York."},{"issue":"4","key":"12_CR17","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/0206055","volume":"6","author":"F. Ruskey","year":"1977","unstructured":"F. Ruskey and T. C. Hu [1977], Generating binary trees lexicographically, SIAM J. Computing 6 (4), 745\u2013758.","journal-title":"SIAM J. Computing"},{"key":"12_CR18","first-page":"1777","volume":"15","author":"J. M. Volosin","year":"1974","unstructured":"Ju. M. Volosin [1974], Enumeration of the terms of object domains according to the depth of embedding, Sov. Math. Dokl. 15, 1777\u20131782.","journal-title":"Sov. Math. Dokl."}],"container-title":["Lecture Notes in Computer Science","CAAP '81"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10828-9_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:39:03Z","timestamp":1619555943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10828-9_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108283","9783540387169"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-10828-9_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981]]}}}