Proceedings of the American Mathematical Society · 1989 · 60 citations · 12 references
ComputingMathematicsStochastic ProcessesRecurrence RelationsRecursion TheoryAsymptotic Analysis Of RecurrencesAsymptotic TheoryHomogeneous Recurrence RelationsRandom Graphs
The asymptotic behavior of the solutions to an interesting class of recurrence relations, which arise in the study of trees and random graphs, is derived by making uniform estimates on the elements of a basis of the solution space. We also investigate a family of polynomials with integer coefficients, which may be called the "tree polynomials."
12
An Introduction to Probability Theory and Its Applications. Vol. II
H. L. B., William Feller · Population · 1968 · 1.2K citations
J. Gani, J. Riordan · Technometrics · 1969 · 955 citations
The Art of Computer Programming, Vol. 2
Donald E. Knuth · Medical Entomology and Zoology · 1981 · 863 citations