Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1984: Automata, Languages and Programming pp 303–311Cite as

Recursion depth analysis for special tree traversal algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 172))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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–22, Academic Press, New York, 1972.

    Google Scholar 

  2. P. Flajolet, Analyse d'algorithmes de manipulation d'arbres et de fichiers, Cahiers du BURO, 34–35 (1981), 1–209.

    Google Scholar 

  3. P. Flajolet and A. Odlyzko, The average height of binary trees and other simple trees, J. Comput. Syst. Sci. 25 (1982), 171–213.

    Google Scholar 

  4. P. FLAJOLET, J.C. RAOULT and J. VUILLEMIN, The number of registers required to evaluate arithmetic expressions, Theoret.Comput.Sci. 9 (1979), 99–125.

    Google Scholar 

  5. J.FÜRLINGER and J.HOFBAUER, q-Catalan numbers, preprint, Universität Wien, 1983.

    Google Scholar 

  6. R. KEMP, The average number of registers needed to evaluate a binary tree optimally, Acta.Inf. 11 (1979), 363–372.

    Google Scholar 

  7. D.E. KNUTH, "The Art of Computer Programming: Fundamental Algorithms", Addison-Wesley, Reading, Mass., 1968.

    Google Scholar 

  8. G. POLYA, On the number of certain lattice polygons, J.Comb.Theory 6 (1969), 102–105.

    Google Scholar 

  9. H.PRODINGER, The height of planted plane trees revisited, Ars Combinatoria, to appear, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra und Diskrete Mathematik TU Vienna, Gußhausstraße 27–29, A-1040, Vienna, Austria

    Peter Kirschenhofer & Helmut Prodinger

Authors
  1. Peter Kirschenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Helmut Prodinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kirschenhofer, P., Prodinger, H. (1984). Recursion depth analysis for special tree traversal algorithms. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation