Author:
Brennan Charlotte,Knopfmacher Arnold
Subject
Applied Mathematics,Statistics, Probability and Uncertainty,Statistics and Probability
Reference13 articles.
1. Barcucci, E., del Lungo, A., Pergola, E., Pinzani, R., 1995. A construction for enumerating k-coloured Motzkin paths. In: Computing and Combinatorics, Lecture Notes in Computer Science, vol. 954, pp. 254–263.
2. Non-uniform random generation of generalised Motzkin paths;Brlek;Acta Informatica,2006
3. The average height of planted plane trees;de Bruijn,1972
4. Analytic Combinatorics;Flajolet,2009
5. The maximal height of simple random walks revisited;Katzenbeisser;Journal of Statistical Planning and Inference,2002
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献