{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:26Z","timestamp":1725662906687},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_27","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:02:46Z","timestamp":1330192966000},"page":"303-311","source":"Crossref","is-referenced-by-count":3,"title":["Recursion depth analysis for special tree traversal algorithms"],"prefix":"10.1007","author":[{"given":"Peter","family":"Kirschenhofer","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"27_CR1","first-page":"15","volume-title":"The average height of planted plane trees, in \"Graph Theory and Computing\"","author":"N. G. Bruijn De","year":"1972","unstructured":"N.G. De Bruijn, D.E. Knuth and S.O. Rice, The average height of planted plane trees, in \"Graph Theory and Computing\" (R.C. Read ed.), 15\u201322, Academic Press, New York, 1972."},{"key":"27_CR2","first-page":"1","volume":"34\u201335","author":"P. Flajolet","year":"1981","unstructured":"P. Flajolet, Analyse d'algorithmes de manipulation d'arbres et de fichiers, Cahiers du BURO, 34\u201335 (1981), 1\u2013209.","journal-title":"Cahiers du BURO"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","volume":"25","author":"P. Flajolet","year":"1982","unstructured":"P. Flajolet and A. Odlyzko, The average height of binary trees and other simple trees, J. Comput. Syst. Sci. 25 (1982), 171\u2013213.","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(79)90009-4","volume":"9","author":"P. Flajolet","year":"1979","unstructured":"P. FLAJOLET, J.C. RAOULT and J. VUILLEMIN, The number of registers required to evaluate arithmetic expressions, Theoret.Comput.Sci. 9 (1979), 99\u2013125.","journal-title":"Theoret.Comput.Sci."},{"key":"27_CR5","unstructured":"J.F\u00dcRLINGER and J.HOFBAUER, q-Catalan numbers, preprint, Universit\u00e4t Wien, 1983."},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00289094","volume":"11","author":"R. Kemp","year":"1979","unstructured":"R. KEMP, The average number of registers needed to evaluate a binary tree optimally, Acta.Inf. 11 (1979), 363\u2013372.","journal-title":"Acta.Inf."},{"key":"27_CR7","volume-title":"The Art of Computer Programming: Fundamental Algorithms","author":"D. E. Knuth","year":"1968","unstructured":"D.E. KNUTH, \"The Art of Computer Programming: Fundamental Algorithms\", Addison-Wesley, Reading, Mass., 1968."},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S0021-9800(69)80113-4","volume":"6","author":"G. Polya","year":"1969","unstructured":"G. POLYA, On the number of certain lattice polygons, J.Comb.Theory 6 (1969), 102\u2013105.","journal-title":"J.Comb.Theory"},{"key":"27_CR9","unstructured":"H.PRODINGER, The height of planted plane trees revisited, Ars Combinatoria, to appear, 1984."}],"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-13345-3_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:46Z","timestamp":1619556766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}