Applied tree enumerations

  • Nachum Dershowitz
  • Shmuel Zaks
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 112)


Binary Tree Internal Node Lattice Path Path Segment Sorting Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. Brinck and N. Y. Foo [1981], Analysis of algorithms on threaded trees, to appear in Comp. J.Google Scholar
  2. [2]
    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–22.Google Scholar
  3. [3]
    B. Dasarathy and C. Yang [1980], A transformation on ordered trees, Comp. J. 23 (2), 161–164.Google Scholar
  4. [4]
    N. Dershowitz [1981], Orderings for term-rewriting systems, to appear in J. Theoretical Computer Science.Google Scholar
  5. [5]
    N. Dershowitz and S. Zaks [1980], Enumerations of ordered trees, Discrete Math. 31 (1), 9–28.Google Scholar
  6. [6]
    A. Dvoretzky and Th. Motzkin [1947], A problem of arrangements, Duke Math. J. 14, 305–313.Google Scholar
  7. [7]
    A. Erdelyi and I. M. H. Etherington [1940], Some problems of non-associative combinations (2), Edin. Math. Notes 32, 7–12.Google Scholar
  8. [8]
    Ph. Flajolet and J. M. Steyaert [1980], On the analysis of tree-matching algorithms, Proc. 7th Intl. Conf. Automata, Languages and Programming, Amsterdam, 208–220.Google Scholar
  9. [9]
    M. Gardner [1976], Mathematical games: Catalan numbers, Scientific American 234 (6), 120–125.Google Scholar
  10. [10]
    D. E. Knuth [1968], The Art of Computer Programming, Vol. 1: Fundamental algorithms, Addison-Wesley, Reading, MA.Google Scholar
  11. [11]
    M. J. Kuchinski [1977], Catalan structures and correspondences, M.S. Thesis, Dept. of Mathematics, West Virginia Univ., Morgantown, WV.Google Scholar
  12. [12]
    A. Meir and J. Moon [1978], On the altitude of nodes in random trees, Can. J. Math. 30 (5), 997–1015.Google Scholar
  13. [13]
    S. G. Mohanty [1979], Lattice Path Counting and Applications, Academic Press, New York.Google Scholar
  14. [14]
    T. V. Narayana [1959], A partial order and its applications to probability, Sankhya 21, 91–98.Google Scholar
  15. [15]
    G. H. Raney [1960], Functional composition patterns and power series reversion, Trans. AMS 94, 441–451.Google Scholar
  16. [16]
    J. Riordan [1968], Combinatorial Identities, Wiley, New York.Google Scholar
  17. [17]
    F. Ruskey and T. C. Hu [1977], Generating binary trees lexicographically, SIAM J. Computing 6 (4), 745–758.Google Scholar
  18. [18]
    Ju. M. Volosin [1974], Enumeration of the terms of object domains according to the depth of embedding, Sov. Math. Dokl. 15, 1777–1782.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Nachum Dershowitz
    • 1
  • Shmuel Zaks
    • 2
  1. 1.Department of Computer ScienceUniversity of IllinoisUrbanaUSA
  2. 2.Department of Computer Science TechnionHaifaIsrael

Personalised recommendations