-
1
-
-
0003192598
-
Enumerative uses of generating functions
-
E. A. Bender and J. R. Goldman, Enumerative uses of generating functions, Indiana Univ. Math. J. 20 (1971) 753-765.
-
(1971)
Indiana Univ. Math. J.
, vol.20
, pp. 753-765
-
-
Bender, E.A.1
Goldman, J.R.2
-
3
-
-
38149147155
-
A bivariate asymptotic expansion of coefficients of powers of generating functions
-
M. Drmota, A bivariate asymptotic expansion of coefficients of powers of generating functions, Europ. J. Combinat. 15 (1994) 139-152.
-
(1994)
Europ. J. Combinat.
, vol.15
, pp. 139-152
-
-
Drmota, M.1
-
4
-
-
0003336536
-
The average case analysis of algorithms: Saddle point asymptotics
-
P. Flajolet and R. Sedgewick, The average case analysis of algorithms: Saddle point asymptotics, INRIA Rpt. No. 2376 (1994).
-
(1994)
INRIA Rpt. No. 2376
-
-
Flajolet, P.1
Sedgewick, R.2
-
5
-
-
38249019619
-
Gaussian limiting distributions for the number of components in combinatorial structures
-
P. Flajolet and M. Soria, Gaussian limiting distributions for the number of components in combinatorial structures, J. Combin. Theory Ser. A 53 (1990) 165-182.
-
(1990)
J. Combin. Theory Ser. A
, vol.53
, pp. 165-182
-
-
Flajolet, P.1
Soria, M.2
-
6
-
-
38049026666
-
Central and local limit theorems applied to asymptotic enumeration IV: Multivariate generating functions
-
Z. Gao and L. B. Richmond, Central and local limit theorems applied to asymptotic enumeration IV: multivariate generating functions, J. Comput. and Appl. Math. 41 (1992) 177-186.
-
(1992)
J. Comput. and Appl. Math.
, vol.41
, pp. 177-186
-
-
Gao, Z.1
Richmond, L.B.2
-
7
-
-
0007468685
-
Some results on the asymptotic behaviour of coefficients of large powers of functions
-
See also the review by A. Meir (MR 96f:41038)
-
D. Gardy, Some results on the asymptotic behaviour of coefficients of large powers of functions, Discrete Math. 139 (1995) 189-217. See also the review by A. Meir (MR 96f:41038).
-
(1995)
Discrete Math.
, vol.139
, pp. 189-217
-
-
Gardy, D.1
-
9
-
-
0000677654
-
Stirling behavior is asymptotically normal
-
L. H. Harper, Stirling behavior is asymptotically normal, Ann. Math. Statist. 38 (1967) 410-414.
-
(1967)
Ann. Math. Statist.
, vol.38
, pp. 410-414
-
-
Harper, L.H.1
-
10
-
-
0002121590
-
A generalisation of Stirling's formula
-
W. K. Hayman, A generalisation of Stirling's formula, J. Reine Angew. Math. 196 (1956) 67-95.
-
(1956)
J. Reine Angew. Math.
, vol.196
, pp. 67-95
-
-
Hayman, W.K.1
-
11
-
-
13744249447
-
The number of increasing subsequences of a random permutation
-
V. Lifschitz and B. Pittel, The number of increasing subsequences of a random permutation, J. Combin. Theory Ser. A 31 (1981) 1-20.
-
(1981)
J. Combin. Theory Ser. A
, vol.31
, pp. 1-20
-
-
Lifschitz, V.1
Pittel, B.2
-
12
-
-
0000278117
-
Asymptotic enumeration methods
-
R. L. Graham, M. Grötschel, and L. Lovász (eds.), Elsevier, Amsterdam
-
A. M. Odlyzko, Asymptotic enumeration methods. In R. L. Graham, M. Grötschel, and L. Lovász (eds.), Handbook of Combinatorics, Vol. II, Elsevier, Amsterdam (1995) 1063-1229.
-
(1995)
Handbook of Combinatorics, Vol. II
, vol.2
, pp. 1063-1229
-
-
Odlyzko, A.M.1
|